Scheduling in a contaminated area: a model and polynomial algorithms

DOI10.1016/J.EJOR.2004.12.012MaRDI QIDQ2491774zbMATH OpenOpenAlexFDO

Authors Adam Janiak, M. 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)

Recommendations

• Scheduling jobs in a contaminated area: a model and heuristic algorithms
• Scheduling linearly shortening jobs under precedence constraints
• Machine scheduling with contiguous processing constraints
• Schedules with precedence restrictions and position-dependent servicing durations
• Effective iterative algorithms in scheduling theory

Cites work

• scientific article; zbMATH DE number 4045467 (Why is no real title available?)
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Complexity of scheduling tasks with time-dependent execution times
• Maximization of Labor Productivity Through Optimal Rest-Break Schedules
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Optimal Scheduling of a Flexible-Duration Rest Period for a Work Group
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling jobs under simple linear deterioration
• Scheduling with time dependent processing times: Review and extensions

Cited in

(11)

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

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

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