On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
From MaRDI portal
Publication:3659516
DOI10.2307/2581775zbMath0513.90042OpenAlexW4249739188MaRDI QIDQ3659516
Ewa Skubalska, Jozef Grabowski, Czesław Smutnicki
Publication date: 1983
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2581775
branch-and-bound algorithmrelaxationlower boundscomputational experiencearbitrary number of machinestwo-machine scheduling problem
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, Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers, Minimizing total tardiness in permutation flowshops, A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks, Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates, Multi-level production scheduling for a class of flexible machining and assembly systems, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, New results in the worst-case analysis for flow-shop scheduling, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Minimizing tardiness in a two-machine flow-shop, Job-shop scheduling with resource-time models of operations, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A fast tabu search algorithm for the permutation flow-shop problem, A two-machine permutation flow shop scheduling problem with buffers, Sequencing of jobs in some production system, Some results of the worst-case analysis for flow shop scheduling, Reduction of job-shop problems to flow-shop problems with precedence constraints, Complexity of flowshop scheduling problems with a new blocking constraint, An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times, The permutation flow shop with buffers: A tabu search approach
