Complexity of scheduling problems with multi-purpose machines
From MaRDI portal
Publication:1374420
DOI10.1023/A:1018950911030zbMath0890.90089MaRDI QIDQ1374420
Peter Brucker, Bernd Jurisch, Andreas Krämer
Publication date: 4 December 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS, Scheduling jobs with equal processing times subject to machine eligibility constraints, A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty, A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions, Concurrent operations can be parallelized in scheduling multiprocessor job shop, Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints, Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint, Asymptotically optimal schedules for single-server flow shop problems with setup costs and times, Scheduling unit length jobs with parallel nested machine processing set restrictions, Scheduling on parallel machines considering job-machine dependency constraints, A robustness measure of the configuration of multi-purpose machines, A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
