Single Machine Common Due Window Scheduling with Controllable Job Processing Times

DOI10.1007/978-3-540-73556-4_30MaRDI QIDQ3611981zbMATH OpenOpenAlexFDO

Authors Guohua Wan

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_30

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A single machine scheduling problem with common due window and controllable processing times
• Single machine due-window assignment and scheduling with controllable processing times
• Single machine scheduling with common due date and controllable processing times
• Single machine common flow allowance scheduling with controllable processing times
• A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

Cited in

(8)

• Single machine common flow allowance scheduling with controllable processing times
• Single machine scheduling with common due date and controllable processing times
• Single CNC machine scheduling with controllable processing times and multiple due dates
• Tackling common due window problem with a two-layered approach
• Single-machine sequencing with controllable processing times
• A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
• Single machine due-window assignment and scheduling with controllable processing times
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach

This page was built for publication: Single Machine Common Due Window Scheduling with Controllable Job Processing Times

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