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
Interstage Transportation Planning in the Deterministic Flow-Shop Environment
TL;DR: This paper devise and formally analyze effective transportation strategies for various situations in this flow-shop environment that are dependent on the amount of time needed for transportation relative to the amount required for task processing.
73
Flow shop scheduling with multiple objectiveof minimizing makespan and total flow time
TL;DR: Three heuristic algorithms namely HAMC1, HAMC2 and HAMC3 have been proposed and two new hybrid algorithms are developed by taking the seed sequences yielded by a method proposed by Rajendran in his work to minimize flow time and improving it using search algorithm.
72
•Journal Article
A State-of-the-art Review of Job-Shop Scheduling Techniques
TL;DR: Assessment of the work done in the job-shop domain is sought by providing a review of many of the techniques used and it is established that methods such as Tabu Search, Genetic Algorithms, Simulated Annealing should be considered complementary rather than competitive.
72
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
TL;DR: The problem addressed in this paper is motivated by the need for having to investigate such a problem in the presence of sequence-dependent setups in a two-machine environment to minimize the makespan, which to the best of the authors' knowledge is the first of its kind.
72
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers
TL;DR: In this paper, a mixed integer programming approach for makespan minimization in flexible flow lines is presented, where a line consists of several processing stages in series, separated by finite intermediate buffers, where each stage has one or more parallel identical machines.
72
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