Production scheduling problems in a textile industry
Article Abstract:
A linear programming model for scheduling is developed fromthe analysis of production scheduling problems in a textile industry. Splittingand preempting of jobs, idle times due to chain replacement and the use of identical, uniform or unrelated looms are considered. Maximum tardiness is selected as an objective function. Upper and lower bounds are obtained for the general case, while the worst-case behavior for uniform looms is expressed as approximate algorithms and for equal looms with similar deadlines as a polynomial algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
A class of node based bottleneck improvement problems
Article Abstract:
A study of special tree path system examines the nodes using a dynamic programming. The purpose is to solve bottleneck improvement problems.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Putting soft OR methods to work: the case of the business improvement project at PowerGen. A nonlinear optimization package for long-term hydrothermal coordination
- Abstracts: An application of Lemke's method to a class of Markov decision problems. A cost allocation problem arising in hub-spoke network systems
- Abstracts: Dynamic lot-sizing with setup cost reduction. Exact solutions to a class of stochastic generalized assignment problems
- Abstracts: Allocation of catalogs to collective customers based on semiparametric response models
- Abstracts: Issues in the implementation of the DSD algorithm for the traffic assignment problem. A continuous whole-link travel time model with occupancy constraint