Journal Article10.1016/0377-2217(93)90246-J
An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times
28
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.
read more
About: This article is published in European Journal of Operational Research. The article was published on 12 Nov 1993. The article focuses on the topics: Flow shop scheduling & Job shop scheduling.
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 survey of scheduling with controllable processing times
Dvir Shabtay,George Steiner +1 more
TL;DR: This paper aims to give a unified framework for scheduling with controllable processing times by providing an up-to-date survey of the results in the field.
417
Simultaneous Job Scheduling and Resource Allocation on Parallel Machines
TL;DR: This paper studies a parallel-machine scheduling model involving both job processing and resource allocation and develops a column generation based branch and bound method for finding optimal solutions for these NP-hard problems.
71
Two-stage production scheduling with an outsourcing option
Kangbok Lee,Byung-Cheon Choi +1 more
TL;DR: In this paper, the authors considered a two-stage production scheduling problem in which each activity requires two operations to be processed in stages 1 and 2, respectively, and the objective was to minimize the weighted sum of the makespan and the total outsourcing cost.
70
Approximation schemes for job shop scheduling problems with controllable processing times
TL;DR: This paper considers two models of controllable processing times: continuous and discrete and presents polynomial time approximation schemes when the number of machines and theNumber of operations per job are fixed.
65
Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases
Chung Yee Lee,Lei Lei +1 more
TL;DR: Efficient algorithms for solving several special cases of such multi-project scheduling problems with controllable project duration and hard resource constraints are presented.
53
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
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.
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
2.5K