A note on reverse scheduling with maximum lateness objective
From MaRDI portal
Publication:398863
DOI10.1007/S10951-013-0314-4zbMATH Open1297.90053DBLPjournals/scheduling/LiBNCSY13OpenAlexW1990831559WikidataQ59901063 ScholiaQ59901063MaRDI QIDQ398863FDOQ398863
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
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
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Minimizing Total Tardiness on One Machine is NP-Hard
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Title not available (Why is that?)
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
- Title not available (Why is that?)
- Inverse scheduling with maximum lateness objective
- A faster algorithm for the maximum weighted tardiness problem
Cited In (1)
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)
