A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times

DOI10.1016/J.EJOR.2009.12.013zbMATH Open1188.90098OpenAlexW2108256893MaRDI QIDQ976475FDOQ976475

George J. Kyparisis, C. Koulamas, Sushil K. Gupta

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

Recommendations

• A unified analysis for scheduling problems with variable processing times
• scientific article; zbMATH DE number 2051966
• A linear time approximation scheme for the single machine scheduling problem with controllable processing times
• A class of single machine scheduling problem with variable processing time
• scientific article; zbMATH DE number 2089208
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Single machine scheduling with discretely controllable processing times
• Single-machine scheduling problems with controllable processing times and learning effect
• Single machine scheduling with total tardiness criterion and convex controllable processing times

zbMATH Keywords

schedulingsingle-machinevariable processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• A survey of scheduling with controllable processing times
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• A state-of-the-art review on scheduling with learning effects
• Scheduling Deteriorating Jobs on a Single Processor
• Single-machine scheduling with learning considerations
• Scheduling problems with a learning effect
• Two parallel machine sequencing problems involving controllable job processing times
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Determination of common due window location in a single machine scheduling problem
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Single-machine sequencing with controllable processing times
• A single machine scheduling problem with common due window and controllable processing times
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

Cited In (7)

• Slack due window assignment scheduling in the single-machine with controllable processing times
• Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity
• Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
• Single-machine group scheduling with deteriorating jobs and allotted resource
• Throughput optimization for the Robotic Cell Problem with Controllable Processing Times
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time

This page was built for publication: A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times

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