A single machine scheduling problem with common due window and controllable processing times
From MaRDI portal
Publication:1374426
DOI10.1023/A:1018965919691zbMath0890.90104OpenAlexW103401832MaRDI QIDQ1374426
Shrikant 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
assignment problemcommon due windowdeterministic single machine schedulingjob earliness and tardiness
Related Items (14)
Due-window assignment scheduling in the proportionate flow shop setting ⋮ A survey on scheduling problems with due windows ⋮ A survey of scheduling with controllable processing times ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Scheduling with controllable release dates and processing times: total completion time minimization ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ On scheduling around large restrictive common due windows ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Minimizing total tardiness on a single machine with controllable processing times ⋮ Two simulated annealing-based heuristics for the job shop scheduling problem ⋮ Scheduling problems with a common due window assignment: A survey
This page was built for publication: A single machine scheduling problem with common due window and controllable processing times
