Approximability of two-machine no-wait flowshop scheduling with availability constraints.
From MaRDI portal
Publication:1413925
DOI10.1016/S0167-6377(02)00230-4zbMath1041.90016OpenAlexW2036739158MaRDI QIDQ1413925
Zhaohui Liu, Cheng, T. C. Edwin
Publication date: 17 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00230-4
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (12)
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints ⋮ Coordinated optimization of production scheduling and maintenance activities with machine reliability deterioration ⋮ An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint ⋮ A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints ⋮ Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ A survey of scheduling problems with no-wait in process ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
Cites Work
- Makespan minimization in open shops: A polynomial time approximation scheme
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: Approximability of two-machine no-wait flowshop scheduling with availability constraints.
