scientific article

DOI<967::AID-NAV3220370616>3.0.CO;2-K 10.1002/1520-6750(199012)37:6<967::AID-NAV3220370616>3.0.CO;2-KzbMath0722.90033MaRDI QIDQ3211098

Uttarayan Bagchi, Reza H. Ahmadi

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sum of job completion timesone-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Two very large-scale neighborhoods for single machine scheduling ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ Scheduling with target start times ⋮ Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems