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
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
TL;DR: The branch and bound algorithm proposed here combines an adaptive branching rule with a fuzzy search strategy to narrow the search tree and lead the search to an optimal solution as early as possible.
28
Two-machine shop scheduling: Compromise between flexibility and makespan value
TL;DR: This paper uses the concept of group-scheduling to characterize a whole set of schedules so as to provide more choice to the decision-maker at any decision point in two-machine shop scheduling problems.
28
An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times
TL;DR: In this article, a 4 3 -approximation algorithm for the m-machine permutation flow shop scheduling problem with m = 2 is presented, where ϱ is the worst-case performance ratio of a procedure used, in the proposed algorithm, for solving the sequencing problem.
28
Constrained scheduling of the inspection activities on semiconductor wafers grouped in families with sequence-dependent set-up times
TL;DR: In this paper, a permutational flow shop group-scheduling problem with sequence-dependent set-up times and limited interoperational buffer capacity has been taken into account, and a benchmark of process scenarios considering different numbers of inspection machines wafers codes and families to be inspected has been generated.
28
Optimal schedules for special structure flowshops
TL;DR: This paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines.
28
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