scientific article; zbMATH DE number 6177807

MaRDI QIDQ4927593zbMATH OpenFDO

Authors Weigang Zhou, Qianqian Feng, Chengxiu Gao

Publication date 20 June 2013

zbMATH Keywords

0-1 non-linear programmingcontrollable processing timesdeteriorating processing timesgreedy algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Nonlinear programming (90C30)

Recommendations

• Single machine scheduling with discretely controllable processing times
• Single machine scheduling with due-date assignment and controllable processing times under deteriorating maintenance consideration
• Makespan minimization in single-machine scheduling with step-deterioration of processing times
• Single machine scheduling with step-deteriorating processing times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Single machine due-window assignment and scheduling with controllable processing times
• Single-machine scheduling with deteriorating functions for job processing times
• scientific article; zbMATH DE number 2051966
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• Single-machine scheduling problems with an actual time-dependent deterioration

Cited in

(2)

• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• Single machine scheduling with total tardiness criterion and convex controllable processing times

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