Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
From MaRDI portal
Publication:2361139
DOI10.1007/s11590-016-1003-yzbMath1372.90048OpenAlexW2296842957WikidataQ57633773 ScholiaQ57633773MaRDI QIDQ2361139
Dmitry I. Arkhipov, Frank Werner, Alexander A. Lazarev
Publication date: 29 June 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1003-y
Related Items
An exact algorithm for the preemptive single machine scheduling of equal-length jobs, Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost, Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine, Scheduling a single machine with primary and secondary objectives
Cites Work
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- Parallel machine problems with equal processing times: a survey
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines