Single-machine sequencing with controllable processing times
From MaRDI portal
Publication:1194768
DOI10.1016/0377-2217(92)90144-XzbMath0760.90058OpenAlexW1978075823MaRDI QIDQ1194768
Publication date: 11 October 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90144-x
Related Items (36)
Single machine batch scheduling to minimize total completion time and resource consumption costs ⋮ Optimal due date assignment in multi-machine scheduling environments ⋮ Scheduling with controllable processing times and compression costs using population-based heuristics ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ A survey of scheduling with controllable processing times ⋮ Single machine scheduling problems with controllable processing times and total absolute differences penalties ⋮ Effects of OCRA parameters and learning rate on machine scheduling ⋮ Two due date assignment problems in scheduling a single machine ⋮ Single machine scheduling with discretely 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 scheduling with learning considerations ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Single-machine scheduling with time-and-resource-dependent processing times ⋮ Scheduling with controllable release dates and processing times: total completion time minimization ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times ⋮ SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE ⋮ Single machine scheduling with common due date and controllable processing times ⋮ Single machine scheduling with resource dependent release times and processing times ⋮ 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 ⋮ Optimal control of production processes with variable execution times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Minimizing completion time variance with compressible processing times ⋮ Single machine common flow allowance scheduling with controllable processing times ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ Single CNC machine scheduling with controllable processing times and multiple due dates ⋮ Minimizing total tardiness on a single machine with controllable processing times ⋮ A fuzzy-linguistic approach to a multi-criteria sequencing problem ⋮ Scheduling under a common due-date on parallel unrelated machines ⋮ A new bounding mechanism for the CNC machine scheduling problems with controllable processing times ⋮ Single–machine scheduling with random machine breakdowns and randomly compressible processing times ⋮ Two parallel machine sequencing problems involving controllable job processing times ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
- A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem
- Solution structures and sensitivity of special assignment problems
- Survey of scheduling research involving due date determination decisions
- The Factored Transportation Problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
This page was built for publication: Single-machine sequencing with controllable processing times
