A Scheduling Problem*
From MaRDI portal
Publication:5677267
DOI10.1057/jors.1973.77zbMath0261.90024MaRDI QIDQ5677267
Seenu S. Reddi, C. V. Ramamoorthy
Publication date: 1973
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1973.77
90B35: Deterministic scheduling theory in operations research
Related Items
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, Some no-wait shops scheduling problems: Complexity aspect, Approximative procedures for no-wait job shop scheduling., Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing, No-wait job shop scheduling: tabu search and complexity of subproblems, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach