Solving the earliness tardiness scheduling problem by DC programming and DCA

MaRDI QIDQ3565731zbMATH OpenFDO

Authors Le Thi Hoai An, Nguyen Quang Thuan, Nguyen Huynh Tuong, Pham Dinh Tao

Publication date 7 June 2010

zbMATH Keywords

DC programmingdifference of convex functionsearliness tardiness schedulingtime-index formulation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• New exact algorithms for one-machine earliness-tardiness scheduling
• An exact approach to early/tardy scheduling with release dates
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• Earliness-tardiness scheduling with setup considerations
• Single machine earliness and tardiness scheduling

Cited in

(3)

• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
• DC programming and DCA: thirty years of developments
• A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors

This page was built for publication: Solving the earliness tardiness scheduling problem by DC programming and DCA

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