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
Stochastic proportionate flowshop scheduling with setups
Ali Allahverdi,Mehmet Savsar +1 more
TL;DR: In this article, the problem of scheduling n jobs on a proportionate two-machine flowshop where the machines are subject to random breakdowns and setup times are considered separate from processing times is addressed.
17
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times
TL;DR: Computational experiments carried out on a large set of randomly generated instances provide evidence that a constructive heuristic based on newly derived priority rule dominates all the proposed constructive heuristics.
17
Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems
TL;DR: A study of a special type of flow shop in which a particular stage of each job is the longest (or the shortest as the case may be) and it is found that the problem remains strongly NP-complete.
17
Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times
Junlin Chang,Weiwu Yan,Huihe Shao +2 more
- 01 Jan 2004
TL;DR: Computational experience demonstrates the effectiveness of the heuristic algorithm including the proposed theorems in finding a near optimal schedule in the two-stage no-wait hybrid flowshop scheduling problem.
Optimal versus heuristic scheduling of surface mount technology lines
TL;DR: In this paper, an exact and a heuristic approach for scheduling of printed wiring board assembly in surface mount technology (SMT) lines is presented and compared, where the exact approach is based on a mixed integer programming formulation that can be used for optimization of assembly schedules.
17
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