Publication:5687639
From MaRDI portal
DOI<629::AID-NAV3>3.0.CO;2-7 10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7zbMath0864.90058MaRDI QIDQ5687639
James D. Blocher, Dilip Chhajed
Publication date: 16 December 1996
90B35: Deterministic scheduling theory in operations research
Related Items
Customer order scheduling on a single machine with family setup times: complexity and algorithms, Scheduling parallel machines for the customer order problem, Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time, Minimizing customer order lead-time in a two-stage assembly supply chain, The complexity of customer order scheduling problems on parallel machines, Scheduling the production of two-component jobs on a single machine, Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines, A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property, Preemptive multiprocessor order scheduling to minimize total weighted flowtime