Single-machine scheduling problems with time and position dependent processing times

DOI10.1007/s10479-011-0835-1zbMath1225.90061OpenAlexW2031002773MaRDI QIDQ646660

Wanzhen Huang, Guangle Yan, Xingong Zhang, Guochun Tang

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0835-1

zbMATH Keywords

single-machine schedulingworst-case errorperformance ratiolearning effect

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Single machine group scheduling with position dependent processing times and ready times ⋮ Strong NP-hardness of scheduling problems with learning or aging effect ⋮ Single machine group scheduling with time and position dependent processing times ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Some results of the worst-case analysis for flow shop scheduling with a learning effect ⋮ Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times ⋮ Scheduling problems with position dependent job processing times: computational complexity results ⋮ Single-machine scheduling problems with a learning effect matrix ⋮ Single-machine group scheduling problems with deteriorating and learning effect

Cites Work

• Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
• Time-dependent scheduling
• Single-machine scheduling with learning considerations
• Scheduling jobs under simple linear deterioration
• Complexity of scheduling tasks with time-dependent execution times
• Scheduling with general job-dependent learning curves.
• Flow shop scheduling jobs with position-dependent processing times
• Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
• A state-of-the-art review on scheduling with learning effects
• Flow-shop scheduling with a learning effect
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
• Scheduling Deteriorating Jobs on a Single Processor
• PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Note on scheduling with general learning curves to minimize the number of tardy jobs
• Scheduling
• Single machine scheduling with learning effect considerations
• Scheduling problems with a learning effect

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