Scheduling in a contaminated area: a model and polynomial algorithms

DOI10.1016/j.ejor.2004.12.012zbMath1125.90354OpenAlexW2009033128MaRDI QIDQ2491774

Adam Janiak, Mikhail Y. Kovalyov

Publication date: 29 May 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.12.012

zbMATH Keywords

algorithmsschedulingsymmetric functioncontaminated areastart time dependent processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ Scheduling problems with partially ordered jobs ⋮ Single-machine scheduling with time-and-resource-dependent processing times ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties ⋮ Single machine scheduling with precedence constraints and positionally dependent processing times ⋮ A note on single-machine scheduling with decreasing time-dependent job processing times ⋮ Partial dominated schedules and minimizing the total completion time of deteriorating jobs ⋮ Preemptive scheduling with simple linear deterioration on a single machine ⋮ Single machine group scheduling with time dependent processing times and ready times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling jobs under simple linear deterioration
• Complexity of scheduling tasks with time-dependent execution times
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Scheduling with time dependent processing times: Review and extensions
• Maximization of Labor Productivity Through Optimal Rest-Break Schedules
• Scheduling Deteriorating Jobs on a Single Processor
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Scheduling of a Flexible-Duration Rest Period for a Work Group
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Scheduling in a contaminated area: a model and polynomial algorithms