Two-machine flowshop scheduling with availability constraints
From MaRDI portal
Publication:1296377
DOI10.1016/S0377-2217(97)00452-9zbMath0971.90031MaRDI QIDQ1296377
Publication date: 2 August 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (46)
Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints ⋮ A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Makespan minimization for two parallel machines with an availability constraint ⋮ Online and semi-online scheduling to minimize makespan on single machine with an availability constraint ⋮ Complexity and approximability of scheduling resumable proportionally deteriorating jobs ⋮ 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 ⋮ Open shop scheduling problem with a non-resumable flexible maintenance period ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ A note on worst-case performance of heuristics for maintenance scheduling problems ⋮ Two-machine flow shop scheduling with an operator non-availability period to minimize makespan ⋮ An improved algorithm for the two machine flow shop problem with several availability constraints ⋮ Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time ⋮ A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines ⋮ Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures ⋮ Scheduling resumable deteriorating jobs on a single machine with non-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. ⋮ Dynamic programming for delayed product differentiation. ⋮ Single machine scheduling with semi-resumable machine availability constraints ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times ⋮ 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 ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ Approximation results for flow shop scheduling problems with machine availability constraints ⋮ A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs ⋮ Scheduling two agents with controllable processing times ⋮ Two-machine open shop scheduling with an availability constraint ⋮ 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 ⋮ 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 ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints ⋮ Single machine scheduling with forbidden start times ⋮ Scheduling a maintenance activity to minimize total weighted completion-time ⋮ An improved heuristic for two-machine flowshop scheduling with an availability constraint ⋮ Optimal online algorithm for scheduling on two identical machines with machine availability constraints. ⋮ 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
- 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
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Current trends in deterministic scheduling
- Machine scheduling with an availability constraint
- Optimal two- and three-stage production schedules with setup times included
- Scheduling on semi-identical processors
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- The Lessons of Flowshop Scheduling Research
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
This page was built for publication: Two-machine flowshop scheduling with availability constraints
