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
Permutation flow‐shop theory revisited
TL;DR: In this article, a new theoretical framework for generating dominance conditions and lower bounds and for solving special cases was proposed, and all existing and new results have been derived in a routine and simple manner.
22
Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum
TL;DR: The parallelisable Simulated Annealing with Genetic Enhancement (SAwGE) algorithm is presented and applied to Permutation Flowshop Scheduling Problem with total flowtime criterion and is proved to be NP-complete in a strong sense for more than one machine.
22
Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
TL;DR: This paper summarizes known analytical results and solution procedures for the 3 × n flow-shop problem and states that not every permutation that is an AB and BC optimum simultaneously is an optimal solution of the entire problem.
22
Sequencing with general precedence constraints
TL;DR: Transformations are developed which systematically reduce the size of the general precedence-constrained problem, and generalize the majority of work previously done on efficient sequencing with precedence constraints.
22
Fuzzy heuristic algorithm for simultaneous scheduling problems in flexible manufacturing system
TL;DR: In this article, a fuzzy heuristic is proposed for solving the simultaneous scheduling problem, in order to minimize the makespan by considering the available resources, and the algorithm is tested based on 82 benchmark problems and the achieved makespan are compared with other algorithms.
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