The customer order lead-time problem on parallel machines

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.90058OpenAlexW1996897620MaRDI QIDQ5687639

James D. Blocher, Dilip Chhajed

Publication date: 16 December 1996

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199608)43:5<629::aid-nav3>3.0.co;2-7

zbMATH Keywords

heuristicsparallel machinesaverage order completion timecustomer order lead-time problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ Customer order scheduling on a single machine with family setup times: complexity and algorithms ⋮ Scheduling parallel machines for the customer order problem ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Scheduling the production of two-component jobs on a single machine ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ 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 ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime ⋮ The complexity of customer order scheduling problems on parallel machines ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem