Single-machine makespan minimization scheduling with nonlinear shortening processing times

DOI10.1016/J.COR.2011.05.001MaRDI QIDQ1762019zbMATH OpenOpenAlexFDO

Authors Ming-Zheng Wang, Ji-Bo Wang

Publication date 15 November 2012

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2011.05.001

zbMATH Keywords

schedulingmakespansingle-machinenonlinear shortening processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling with nonlinear deterioration
• Single machine scheduling problem with nonlinear processing times
• scientific article; zbMATH DE number 2219123
• Scheduling jobs with position and sum-of-processing-time based processing times
• Scheduling jobs with piecewise linear decreasing processing times

Cites work

• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
• Batch scheduling of step deteriorating jobs
• Minimizing Variation of Flow Time in Single Machine Systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling jobs under decreasing linear deterioration
• Scheduling with time dependent processing times: Review and extensions
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
• Time-dependent scheduling

Cited in

(4)

• On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
• Single machine scheduling problem with nonlinear processing times
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions

This page was built for publication: Single-machine makespan minimization scheduling with nonlinear shortening processing times

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