A note on reverse scheduling with maximum lateness objective

DOI10.1007/S10951-013-0314-4MaRDI QIDQ398863zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shisheng Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, N. V. Shakhlevich, Jinjiang Yuan

Publication date 18 August 2014

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL http://eprints.whiterose.ac.uk/79237/8/LiNgChengYuan.pdf

zbMATH Keywords

maximum latenessreverse scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Inverse scheduling with maximum lateness objective
• Inverse problems of single machine scheduling on processing times of jobs
• Inverse scheduling: Two-machine flow-shop problem
• Single machine total tardiness maximization problems: complexity and algorithms
• Maximization problems in single machine scheduling

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• A faster algorithm for the maximum weighted tardiness problem
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Inverse scheduling with maximum lateness objective
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Reducibility among combinatorial problems

Cited in

(1)

• Inverse scheduling with maximum lateness objective

This page was built for publication: A note on reverse scheduling with maximum lateness objective

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