Journal Article10.1002/NAV.3800010110
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
read more
Abstract: Each of a collection of items are to be produced on two machines (or stages). Each machine can handle only one item at a time and each item must be processed through machine one and then through machine two. The setup time plus work time for each item for each machine is known. A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum. A three-machine problem is also discussed and solved for a restricted case.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
TL;DR: This paper initiates research into scheduling with batching in the no-wait flowshop environment and gives NP -hardness proofs for three special cases, suggesting that it is very unlikely to devise an efficient method to find an optimal schedule for the problem under study.
39
A two-stage flow-shop scheme for the multi-satellite observation and data-downlink scheduling problem considering weather uncertainties
TL;DR: A two-stage flow shop scheme for the MSODSP is developed in order to optimize the observation scheduling and data-downlink scheduling concurrently and get truly optimized results.
39
Unit sized transfer batch scheduling with setup times
TL;DR: In this paper, the authors considered the two stage flow shop problem of minimizing the total completion time, in which all transfer batches are of unit size for each job, and developed an optimal solution procedure for unit sized transfer batch scheduling with setup times which are independent of the sequence and are separated from the processing times at both stages.
39
Metaheuristics for the mixed shop scheduling problem
Shi Qiang Liu,H. L. Ong +1 more
TL;DR: The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems and reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the Mixed shop.
39
The flow shop problem with no-idle constraints: A review and approximation☆
TL;DR: Several polynomial time heuristics are proposed which provide asymptotically optimal solutions for the increasing number of jobs in makespan minimization problem in flow shops with no-idle constraints on machines.
39
References
On a quantitative method in production planning and scheduling
TL;DR: In this article, a conceptual model of production is constructed illustrating the methods which the manager uses in planning and scheduling production, and it is compared with industrial practices and with other mathematical models of production.
31