On two-machine scheduling with release and due dates to minimize maximum lateness
From MaRDI portal
Publication:1149374
zbMath0453.90043MaRDI QIDQ1149374
Publication date: 1980
Published in: Opsearch (Search for Journal in Brave)
branch-and-bound algorithmrelease datesdue datescomputational experiencetwo-machine schedulingcritical path conceptminimization of maximum latenesssequencing n jobs
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items
A block approach for single-machine scheduling with release dates and due dates, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem, Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, The two-machine flowshop scheduling problem with total tardiness, Heuristic procedures for minimizing makespan and the number of required pallets, Job lateness in a two-machine flowshop with setup times separated, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, A computational study of the permutation flow shop problem based on a tight lower bound, Minimizing tardiness in a two-machine flow-shop, Job-shop scheduling with resource-time models of operations, A fast tabu search algorithm for the permutation flow-shop problem, Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness, Reduction of job-shop problems to flow-shop problems with precedence constraints, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, The permutation flow shop with buffers: A tabu search approach
