Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
From MaRDI portal
Publication:3163694
DOI10.1080/00207540802620779zbMath1197.90207OpenAlexW2099506176MaRDI QIDQ3163694
Ye Jin, Xiao-Feng Hu, Jinsong Bao
Publication date: 26 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802620779
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items (3)
A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
Cites Work
- On a parallel machine scheduling problem with precedence constraints
- A state-of-the-art review of parallel-machine scheduling research
- Developing scheduling systems for Daewoo shipbuilding: DAS project
- Heuristics for unrelated machine scheduling with precedence constraints
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- List scheduling in a parallel machine environment with precedence constraints and setup times
- Parallel machine scheduling with machine availability and eligibility constraints
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- Generation of production material information for a building block and simulation of block erection for process planning and scheduling in shipbuilding
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
This page was built for publication: Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
