A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
Article Abstract:
The problems of completing a job in a batch on time using a single machine are examined. The methods that reduce the single machine, serial batching scheduling problem are presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
Article Abstract:
The solutions for single-variable-resource scheduling problems with relation to job completion time minimization are presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Single machine scheduling with batch deliveries. Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Abstracts: Short-term booking of air cargo space. Using genetic algorithms for single-machine bicriteria scheduling problems
- Abstracts: A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment
- Abstracts: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. A scheduling policy for adjusting economic lot quantities to a feasible solution
- Abstracts: Lot streaming with detached setups in three-machine flow shops. Manufacturing lead time estimation using data mining