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 GPU-based Branch-and-Bound algorithm using IntegerVectorMatrix data structure
Jan Gmys,Mohand-Said Mezmaz,Nouredine Melab,Daniel Tuyttens +3 more
- 01 Nov 2016
TL;DR: This paper revisits the IVM-based B&B algorithm on the GPU, addressing the irregularity of the algorithm in terms of workload, memory access patterns and control flow, and focuses on reducing thread divergence by making a judicious choice for the mapping of threads onto the data.
New results in the worst-case analysis for flow-shop scheduling
TL;DR: The worst-case analysis of the approximation algorithm proposed by Palmer and the algorithm RAES (the best of algorithms proposed by Dannenbring) for m-machine permutation flow-shop problem are presented and the worst- case performance ratios equal approximately m 2 for each of the algorithms.
30
Flowshop scheduling with sequence dependent setup times and batch delivery in supply chain
TL;DR: Three new metaheuristic algorithms such as Differential Evolution with different mutation strategy variation and a Moth Flame Optimization, and Levy-Flight Moth flame Optimization algorithm are proposed and presented.
30
Discrete fuzzy optimization
Stefan Chanas,Dorota Kuchta +1 more
- 01 Apr 1999
TL;DR: The chapter presents selected problems and algorithms of fuzzy discrete optimization that constitute fuzzy equivalents of the following crisp ones: the maximal and cheapest flow and the shortest route problem in a network, the transportation and assignment problems, the CPM and PERT method.
30
Dispatching in flowshops with bottleneck machines
TL;DR: The results of the experimental investigation show that the proposed dispatching rules emerge to be superior to the conventional dispatching Rules for scheduling by taking into account the presence of bottleneck machines.
30
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