Complexity of scheduling problems with multi-purpose machines

DOI10.1023/A:1018950911030zbMath0890.90089OpenAlexW146567170MaRDI QIDQ1374420

Andreas Krämer, Bernd Jurisch, Peter Brucker

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018950911030

zbMATH Keywords

multi-purpose machine scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Scheduling on parallel machines considering job-machine dependency constraints ⋮ Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ A robustness measure of the configuration of multi-purpose machines ⋮ A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions ⋮ APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines ⋮ Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints ⋮ Multi-project scheduling problem under shared multi-skill resource constraints ⋮ Scheduling problem with multi-purpose parallel machines ⋮ Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Asymptotically optimal schedules for single-server flow shop problems with setup costs and times ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ Ideal schedules in parallel machine settings ⋮ Scheduling equal length jobs with eligibility restrictions ⋮ A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES ⋮ A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty ⋮ Scheduling unit length jobs with parallel nested machine processing set restrictions ⋮ Concurrent operations can be parallelized in scheduling multiprocessor job shop