Flow shops with machine maintenance: ordered and proportionate cases
From MaRDI portal
Publication:992582
DOI10.1016/j.ejor.2010.04.018zbMath1205.90119OpenAlexW2163950265MaRDI QIDQ992582
Joseph Y.-T. Leung, Byung-Cheon Choi, Kangbok Lee, Michael L. Pinedo
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.04.018
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study, Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem, Online scheduling of ordered flow shops, Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- A note on the complexity of flow shop scheduling with transportation constraints
- Approximation results for flow shop scheduling problems with machine availability constraints
- Batching and scheduling in a multi-machine flow shop
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- A note on the proportionate flow shop with a bottleneck machine
- Minimizing total weighted completion time in a proportionate flow shop
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- The three-machine proportionate flow shop problem with unequal machine speeds
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- Optimal two- and three-stage production schedules with setup times included
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Focused Scheduling in Proportionate Flowshops
- Ordered Flow Shop Problems with no In-Process Waiting: Further Results
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop sequencing problem with ordered processing time matrices: A general case
- The Complexity of Flowshop and Jobshop Scheduling
- Flowshop-scheduling problems with makespan criterion: a review
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
- Two-machine flow shops with limited machine availability
