Scheduling jobs in a contaminated area: a model and heuristic algorithms

DOI10.1057/PALGRAVE.JORS.2602406MaRDI QIDQ3519368zbMATH OpenOpenAlexFDO

Authors Adam Janiak, M. Y. Kovalyov

Publication date 14 August 2008

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2602406

zbMATH Keywords

computational complexitysingle machinestart time-dependent processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scheduling in a contaminated area: a model and polynomial algorithms
• On the continuous working problem
• scientific article; zbMATH DE number 4072697
• scientific article; zbMATH DE number 1594552
• scientific article; zbMATH DE number 4095196

Cited in

(4)

• A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
• Scheduling in a contaminated area: a model and polynomial algorithms
• Partial dominated schedules and minimizing the total completion time of deteriorating jobs
• Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities

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

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