Single-machine scheduling problems with start-time dependent processing time

DOI10.1016/j.camwa.2006.07.012zbMath1152.90450OpenAlexW2081974353MaRDI QIDQ2519639

Wen-Hung Kuo, Dar-Li Yang

Publication date: 27 January 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.07.012

zbMATH Keywords

schedulingmakespansingle-machinecompletion timetime dependent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models ⋮ Single-machine scheduling with nonlinear deterioration ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Scheduling with time dependent processing times: Review and extensions
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Single-machine scheduling problems with start-time dependent processing time