Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
From MaRDI portal
Publication:1362517
DOI10.1016/S0167-6377(96)00041-7zbMath0882.90069OpenAlexW2071126781MaRDI QIDQ1362517
Publication date: 5 August 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00041-7
Related Items (51)
Scheduling jobs and maintenance activities on parallel machines ⋮ A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Unnamed Item ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Scheduling jobs in open shops with limited machine availability ⋮ Two-agent scheduling in a flowshop ⋮ Heuristics for two-machine flowshop scheduling with setup times and an availability constraint ⋮ An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint ⋮ An integrated production and preventive maintenance planning model ⋮ Two-machine flow shop scheduling with an operator non-availability period to minimize makespan ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint ⋮ An improved algorithm for the two machine flow shop problem with several availability constraints ⋮ A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints ⋮ Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown ⋮ Minimizing the makespan for the flow shop scheduling problem with availability constraints. ⋮ Scheduling with limited machine availability ⋮ A two-machine flowshop scheduling problem with a separated maintenance constraint ⋮ The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis ⋮ A PTAS for a particular case of the two-machine flow shop with limited machine availability ⋮ Integrated production planning and preventive maintenance in deteriorating production systems ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ Approximation results for flow shop scheduling problems with machine availability constraints ⋮ Job scheduling and management of wearing tools with stochastic tool lifetimes ⋮ A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints ⋮ An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs ⋮ A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint ⋮ Scheduling two-stage hybrid flow shop with availability constraints ⋮ Two-machine open shop scheduling with an availability constraint ⋮ Two-machine flow shop scheduling problems with no-wait jobs ⋮ Two-machine flow shops with limited machine availability ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Two-machine flow shop and open shop scheduling problems with a single maintenance window ⋮ Two-machine flow shop scheduling integrated with preventive maintenance planning ⋮ Approximation results for the two-machine job shop under limited machine availability ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints ⋮ Stability of Johnson's schedule with respect to limited machine availability ⋮ Match-up scheduling under a machine breakdown ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ Optimality of Jackson's permutations with respect to limited machine availability ⋮ On-line and semi-online scheduling for flow shop problems on two machines ⋮ Two-machine flowshop scheduling with availability constraints ⋮ A new tabu search procedure for an audit-scheduling problem ⋮ An improved heuristic for two-machine flowshop scheduling with an availability constraint ⋮ Machine scheduling with a rate-modifying activity ⋮ Optimal online algorithm for scheduling on two identical machines with machine availability constraints. ⋮ Heuristics for two-machine no-wait flowshop scheduling with an availability constraint ⋮ Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints ⋮ Single-machine scheduling with periodic maintenance and nonresumable jobs.
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- Single machine flow-time scheduling with scheduled maintenance
- Single machine flow-time scheduling with a single breakdown
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Minimizing the sum of job completion times on capacitated parallel machines
- Minimizing makespan in hybrid flowshops
- Machine scheduling with an availability constraint
- Optimal two- and three-stage production schedules with setup times included
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- The Lessons of Flowshop Scheduling Research
- The Complexity of Flowshop and Jobshop Scheduling
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
This page was built for publication: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
