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
Trade-off balancing in scheduling for flow shop production and perioperative processes
TL;DR: A constructive CFD heuristic is developed that enables a serial process to have a larger tolerance on variations of process performance, and keeps the process better under control, and can be significant for flow shop scheduling in manufacturing in trading-off production and holding costs.
16
Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs
R. Rajkumar,P. Shahabudeen +1 more
TL;DR: Computation results based on some permutation flowshop scheduling benchmark problems (OR-Library) show that the IGA gives better solution when compared with the earlier reported results.
16
An Improved Heuristic for Permutation Flow Shop Scheduling (NEH ALGORITHM)
Ekta Singhal,Shalu Singh,Aneesh Dayma +2 more
- 01 Jan 2012
TL;DR: In this paper, a modified version of the NEH (Nawaz, Enscore, Ham) algorithm is proposed to solve the PFSPP problem with the constraint that machines can only process one job at a time and jobs can be processed by only one machine at time, and no machine is allowed to remain idle when a job is ready for processing.
A Scatter Search Method for Multiobjective Fuzzy Permutation Flow Shop Scheduling Problem: A Real World Application
Orhan Engin,Cengiz Kahraman,Mustafa Yilmaz +2 more
- 01 Jan 2009
TL;DR: In this paper, a scatter search (SS) method is proposed to solve the multiobjective permutation fuzzy flow shop scheduling problem, where the objectives are minimizing the average tardiness and the number of tardy jobs.
16
•Dissertation
Modélisation, analyse et pilotage de flux en milieu hospitalier à l'aide d'UML et des réseaux de Petri
Vincent Augusto
- 07 Nov 2008
TL;DR: In this article, the authors propose a plate-forme medPRO (medical Process-Resource-Organisation) for modeling and simulation of hospitaliers, which is based on UML (Unified Modelling Language).
16
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