No-wait flow shop scheduling with large lot sizes
Explore this paper's citation graph
Summary
An ε-approximate algorithm is proposed, based on the solution to a trans-portation problem, and the relative error of the approximation goes to zero as the size of any lot grows.
- Type
- article
- Published
- 1997-04-01
- Cited by
- 19
- References
- 20
- OpenAlex
- https://openalex.org/W16805603
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:3407691
Keywords
Theory of computation, Set (abstract data type), Series (stratigraphy), Constraint (computer-aided design), Algorithm
References
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Solvable Cases of the No-Wait Flow-Shop Scheduling Problem
- Network Flows: Theory, Algorithms, and Applications
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- On Scheduling Independent Tasks with Restricted Execution Times
- Optimal two- and three-stage production schedules with setup times included
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Scheduling Algorithms for Flexible Flow Lines
- Heuristics for flow-shop scheduling
- Finding Minimum-Cost Circulations by Successive Approximation
- The Traveling Salesman Problem with Many Visits to Few Cities
- Flowshop scheduling with limited temporary storage
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Batch Scheduling in a Two-machine Flow Shop with Limited Buffer
- Local Search for the Asymmetric Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Vehicle scheduling in two-cycle flexible manufacturing systems
- Just-in-time Scheduling in a Pipeline Manufacturing System
- Toyota Production System: Practical Approach to Production Management
- Solvable Cases of the No-Wait Flow-Shop Scheduling Problem
Cited by
- Concurrent operations assignment and sequencing for particular assembly problems in flow lines
- Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time
- Bin packing using semi-ordinal data
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
- Ordinal algorithms for parallel machine scheduling
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
- On the high multiplicity traveling salesman problem
- Ordinal algorithms for packing with target center of gravity
- A review of TSP based approaches for flowshop scheduling
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- Multiplicity and complexity issues in contemporary production scheduling
- Approximability and in-approximability results for no-wait shop scheduling
- A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage
- High-Multiplicity Scheduling and Packing Problems. (Ordonnancement et Conditionnement en High-Multiplicity)
- An upper bound for the inter-exit time of two jobs in an m-machine flow shop
- Throughput Rate Optimization in High Multiplicity Sequencing Problems
- The No-Wait Flow Shop
- Ordinal On-Line Scheduling on Two Uniform Machines
Related papers
- On the Steiner antipodal number of graphs
- List of conjectural series for powers of π and other constants
- On an Exact Penalty Result and New Constraint Qualifications for Mathematical Programs with Vanishing Constraints
- Bipartite Coverings and the Chromatic Number
- Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees
- Notes on Some Constraint Qualifications for Mathematical Programs with Equilibrium Constraints
- On Constraint Qualification in Multiobjective Optimization Problems: Semidifferentiable Case
- An approximation algorithm for the traveling tournament problem
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties