Preemptive job-shop scheduling problems with a fixed number of jobs
From MaRDI portal
Publication:1299919
zbMath0948.90064MaRDI QIDQ1299919
Svetlana A. Kravchenko, Peter Brucker, Yuri N. Sotskov
Publication date: 7 September 1999
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Related Items (8)
Scheduling equal processing time jobs to minimize the weighted number of late jobs ⋮ Using mixed graph coloring to minimize total completion time in job shop scheduling ⋮ Makespan minimization in preemptive two machine job shops ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Complexity of mixed shop scheduling problems: A survey ⋮ Complexity of shop-scheduling problems with fixed number of jobs: a survey ⋮ Mathematical models for preemptive shop scheduling problems ⋮ Deterministic job-shop scheduling: Past, present and future
This page was built for publication: Preemptive job-shop scheduling problems with a fixed number of jobs
