scientific article; zbMATH DE number 1530367

MaRDI QIDQ4514799zbMATHFDO

Authors Meral Azizoğlu, Suna Kondak, Murat Köksalan

Publication date 28 June 2001

zbMATH Keywords

schedulingsingle machinepolynomial time algorithmbicriteria problemminimizing number of tardy jobs and maximum earliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
• scientific article; zbMATH DE number 1149801
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs

Cited in

(2)

• Punctuality and idleness in just-in-time scheduling
• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs

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 Q4514799)