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
•Journal Article
Metaheuristics for the mixed shop scheduling problem
Shi Qiang Liu,H. L. Ong +1 more
TL;DR: In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems, and the performance of the proposed algorithms is evaluated by means of a set of Lawrence's benchmark instances for the job shop problem.
23
Optimal Scheduling in a Multistage Flowshop
TL;DR: The combinatorial analysis for the flow shop scheduling problem is extended and an algorithm is proposed for the solution of the multistage flowshop scheduling problem, where the objective is to minimize a specified measure of total production cost and jobs have their associated start and stop lags.
23
Flow shop and open shop scheduling with a critical machine and two operations per job
TL;DR: This paper develops polynomial time algorithms to solve the m machine flow shop and open shop makespan problems with a critical machine and at most two operations per job under certain assumptions.
23
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints
TL;DR: This paper studies the permutation flowshop scheduling problem with sequence dependent setup times and time lags constraints minimizing the number of tardy jobs with two mathematical programming formulations proposed.
23
Scheduling Problems in Cross Docking
Rongjun Chen,Baoqiang Fan,Guochun Tang +2 more
- 18 Jun 2009
TL;DR: Using the theories and methodologies of scheduling, the problem is formulated into a two-stage scheduling problem and heuristics with worst-case performance analysis under parallel, uniform and open-shop machines are proposed.
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