Applying new dominance concepts to job schedule optimization

DOI10.1016/S0377-2217(82)80010-6zbMath0482.90042OpenAlexW2039607168MaRDI QIDQ1162922

G. Fontan, C. Mercé, Jacques Erschler, François Roubellat

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(82)80010-6

zbMATH Keywords

computational experimentssingle machinebranch and bound proceduredominance conceptminimization of total elapsed timescheduling of independent jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Single machine scheduling with flow time and earliness penalties

Cites Work

• Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
• Minimizing maximum lateness on one machine: computational experience and some applications

This page was built for publication: Applying new dominance concepts to job schedule optimization