A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
From MaRDI portal
Publication:976475
DOI10.1016/j.ejor.2009.12.013zbMath1188.90098OpenAlexW2108256893MaRDI QIDQ976475
Sushil K. Gupta, Kyparisis, George J., Christos P. Koulamas
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.12.013
Related Items (7)
Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ Slack due window assignment scheduling in the single-machine with controllable processing times ⋮ Throughput optimization for the Robotic Cell Problem with Controllable Processing Times ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine ⋮ Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
Cites Work
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Single-machine scheduling with learning considerations
- Single-machine sequencing with controllable processing times
- Determination of common due window location in a single machine scheduling problem
- Two parallel machine sequencing problems involving controllable job processing times
- A single machine scheduling problem with common due window and controllable processing times
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- A survey of scheduling with controllable processing times
- A state-of-the-art review on scheduling with learning effects
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Scheduling Deteriorating Jobs on a Single Processor
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Scheduling problems with a learning effect
- Unnamed Item
This page was built for publication: A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
