Single-machine sequencing with controllable processing times
From MaRDI portal
Recommendations
- Some comments on sequencing with controllable processing times
- Two parallel machine sequencing problems involving controllable job processing times
- Single machine scheduling with discretely controllable processing times
- Single Machine Common Due Window Scheduling with Controllable Job Processing Times
- A survey of results for sequencing problems with controllable processing times
Cites work
- A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Solution structures and sensitivity of special assignment problems
- Survey of scheduling research involving due date determination decisions
- The Factored Transportation Problem
Cited in
(38)- Single machine common flow allowance scheduling with controllable processing times
- Single-machine scheduling with time-and-resource-dependent processing times
- Scheduling with controllable release dates and processing times: total completion time minimization
- Single machine scheduling with common due date and controllable processing times
- Single CNC machine scheduling with controllable processing times and multiple due dates
- Optimal control of production processes with variable execution 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
- Some comments on sequencing with controllable processing times
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- A fuzzy-linguistic approach to a multi-criteria sequencing problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Optimal due date assignment in multi-machine scheduling environments
- Single machine batch scheduling to minimize total completion time and resource consumption costs
- Minimizing completion time variance with compressible processing times
- Effects of OCRA parameters and learning rate on machine scheduling
- A survey of scheduling with controllable processing times
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- A new perspective on single-machine scheduling problems with late work related criteria
- Two due date assignment problems in scheduling a single machine
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Single machine scheduling with discretely controllable processing times
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Single-machine scheduling with learning considerations
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- 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
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
- Two parallel machine sequencing problems involving controllable job processing times
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- scientific article; zbMATH DE number 5172390 (Why is no real title available?)
- Scheduling under a common due-date on parallel unrelated machines
- Scheduling with due date assignment under special conditions on job processing
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times
- Scheduling with controllable processing times and compression costs using population-based heuristics
This page was built for publication: Single-machine sequencing with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194768)
