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
A heuristic for adaptive production scheduling and control in flow shop production
TL;DR: In this article, an average processing time and lever (APT-LVR) heuristic, integrated with a closed-loop feedback control scheme, is proposed to achieve adaptive production scheduling and control in flow shop production.
21
A self-evolving artificial immune system II with T-cell and B-cell for permutation flow-shop problem
TL;DR: This paper develops a self-evolving artificial immune system II by coordinating the T and B cell in the immune system to build a block-based artificial chromosome to shorten the computation time and to improve the performance for problems of different complexities.
21
An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
TL;DR: An enhancement procedure is presented that, once applied to any arbitrary solution, produces a schedule that is at most equal 2 times the optimal makespan, and an improved heuristic is developed with a relative worst-case error of 3/2.
21
Flowshop/no-idle scheduling to minimise the mean flowtime
Laxmi Narain,P. C. Bagga +1 more
TL;DR: In this article, a branch and bound technique has been developed to solve the problem of n-job, 2-machine flow shop/mean flowtime scheduling under a "no-idle" constraint.
21
A state-of-the-art survey on multi-scenario scheduling
Dvir Shabtay,Miri Gilenson +1 more
TL;DR: In this paper , the authors present a unified framework for scheduling in a multi-scenario environment by presenting an up-to-date survey of results in this field and suggest many challenges for future research.
21
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