An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
From MaRDI portal
Publication:1772863
DOI10.1016/j.cor.2004.03.003zbMath1116.90347OpenAlexW2085055635MaRDI QIDQ1772863
Emerson C. Colin, Roberto C. Quinino
Publication date: 21 April 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.003
Related Items
An improved earliness--tardiness timing algorithm ⋮ Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job ⋮ Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
Cites Work