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
Total Late Work Criteria for Shop Scheduling Problems
Jacek Blazewicz,Erwin Pesch,Malgorzata Sterna,Frank Werner +3 more
- 01 Jan 2000
TL;DR: New results are presented concerning general complexity of scheduling problems with the late work criteria and some special cases in the shop environment.
24
Job Shop Scheduling Problem: an Overview
Amr Arisha,Paul Young,Mohie El Baradie +2 more
- 01 Jan 2001
TL;DR: A survey which covers most of the solving techniques of Job Shop Scheduling (JSS) problem and a classification of these techniques has been proposed: Traditional Techniques and Advanced Techniques.
Knowledge-Based Systems Techniques and Applications in Scheduling
Jürgen Sauer
- 01 Jan 1999
TL;DR: In this chapter an overview of scheduling problems, techniques to solve scheduling problem, scheduling systems as well as research issues in scheduling is given.
23
Evaluating the performance of tabu search procedures for flow shop sequencing
TL;DR: By combining different neighbourhood structures, neighbourhood examinations, and stopping conditions, alternative tabu search procedures are obtained and the relative performance of such procedures is evaluated considering both the solution quality and computational effort.
23
•Proceedings Article
Minimizing makespan on two-machine re-entrant flowshop
Seong-Woo Choi,Yeong-Dae Kim +1 more
- 01 Jan 2004
TL;DR: This paper develops dominance properties, lower bounds and heuristic algorithms for the problem, and uses these to develop a branch and bound algorithm for the two-machine re-entrant flowshop scheduling problem.
23
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