scientific article; zbMATH DE number 710498

MaRDI QIDQ4319557zbMATH OpenFDO

Authors C. K. Y. Lin, K. B. Haley

Publication date 11 January 1995

zbMATH Keywords

branch-and-boundgreedy and iterative heuristicslower boundsmaximum completion timesingle-server systemtwo service phases

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
• Two-machine interval shop scheduling with time lags
• Scheduling coupled-operation jobs with exact time-lags
• On-line two-machine job shop scheduling with time lags
• The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan

Cited in

(2)

• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• Scheduling coupled-operation jobs with exact time-lags

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319557)