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
The Coordination of Pricing and Scheduling Decisions
Zhi-Long Chen,Nicholas G. Hall +1 more
TL;DR: The main managerial insight is that there is a significant benefit even if pricing and scheduling are only heuristically or partially coordinated, and heuristic and partial coordination are simple to achieve.
30
A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time
Weibo Liu,Yan Jin,Mark Price +2 more
TL;DR: A new heuristic based on the Nawaz–Enscore–Ham algorithm is proposed in this article for solving a permutation flow-shop scheduling problem and better solution quality is illustrated compared to existing benchmark heuristics.
On a scheduling problem
Toji Makino
- 01 Jan 1965
TL;DR: An optimal processing order is obtained in the case where the handling time is treated as random variables to minimize the time required to complete all the operations.
An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
TL;DR: The proposed approach converts breakdowns scheduling problems into a finite sequence of without-breakdowns problems, and considers random variables, which measure the length of availability periods and repair times, to study availability intervals of machines.
30
More on three-machine no-idle flow shops
TL;DR: A simple network representation of the makespan is identified that provides a better insight into the problem, reveals a certain anomaly resulting from the no-idle condition, and leads to some dominance relations among the machines under which the problem becomes efficiently solvable.
30
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