A single machine scheduling problem with common due window and controllable processing times

DOI10.1023/A:1018965919691MaRDI QIDQ1374426zbMATH OpenOpenAlexFDO

Authors S. S. Panwalkar, Sansern Thongmee, Surya Danusaputro Liman

Publication date 4 December 1997

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018965919691

zbMATH Keywords

assignment problemcommon due windowdeterministic single machine schedulingjob earliness and tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single Machine Common Due Window Scheduling with Controllable Job Processing Times
• Single machine scheduling with common due date and controllable processing times
• Single machine due-window assignment and scheduling with controllable processing times
• Common due window size and location determination in a single machine scheduling problem
• A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

Cited in

(22)

• Due-window assignment scheduling in the proportionate flow shop setting
• Single Machine Scheduling with a Common Delivery Window
• Scheduling with controllable release dates and processing times: total completion time minimization
• Scheduling two projects with controllable processing times in a single-machine environment
• Single machine scheduling with common due date and controllable processing times
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• Common due window size and location determination in a single machine scheduling problem
• On scheduling around large restrictive common due windows
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• A survey of scheduling with controllable processing times
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• Single Machine Common Due Window Scheduling with Controllable Job Processing Times
• A survey on scheduling problems with due windows
• Minimizing total tardiness on a single machine with controllable processing times
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
• Scheduling problems with a common due window assignment: a survey
• 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
• Scheduling with due date assignment under special conditions on job processing
• Two simulated annealing-based heuristics for the job shop scheduling problem
• Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times

This page was built for publication: A single machine scheduling problem with common due window and controllable processing times

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