A block approach for single-machine scheduling with release dates and due dates
From MaRDI portal
Publication:1083026
DOI10.1016/0377-2217(86)90191-8zbMath0603.90073OpenAlexW2058004157MaRDI QIDQ1083026
Stanisław Zdrzałka, Eugeniusz Nowicki, Jozef Grabowski
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90191-8
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
A branch and bound algorithm for the job-shop scheduling problem, Preemptive scheduling with release dates, delivery times and sequence independent setup times, Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Problems of discrete optimization: challenges and main approaches to solve them, Theoretical expectation versus practical performance of Jackson's heuristic, A sequencing problem with family setup times, An algorithm for single machine sequencing with release dates to minimize maximum cost, New single machine and job-shop scheduling problems with availability constraints, Developing feasible and optimal schedules of jobs on one machine, An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times, Scheduling Algorithms for Single Machine Problem with Release and Delivery Times, Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails, A tabu search approach for proportionate multiprocessor open shop scheduling, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis, Four decades of research on the open-shop scheduling problem to minimize the makespan, On the heuristic solution of the permutation flow shop problem by path algorithms, Improving earliest starting times in machine scine scheduling problem, Tabu search algorithms for job-shop problems with a single transport robot, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, A genetic algorithm methodology for complex scheduling problems, Effective heuristics for the single machine sequencing problem with ready times, Jackson's semi-preemptive scheduling on a single machine, Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints, Deterministic job-shop scheduling: Past, present and future, An exact block algorithm for no-idle RPQ problem, Extending the shifting bottleneck procedure to real-life applications, The job shop scheduling problem: Conventional and new solution techniques, A fast tabu search algorithm for the permutation flow-shop problem, A two-machine permutation flow shop scheduling problem with buffers, A production rescheduling expert simulation system, Sequencing of jobs in some production system, Scheduling a single machine with primary and secondary objectives, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems, Online Scheduling on Two Parallel Machines with Release Times and Delivery Times, An approximation algorithm for a single-machine scheduling problem with release times and delivery times, A tabu search algorithm for scheduling a single robot in a job-shop environment, Tabu search for the job-shop scheduling problem with multi-purpose machines, An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two-machine scheduling with release and due dates to minimize maximum lateness
- The one-machine sequencing problem
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Minimizing maximum lateness on one machine: computational experience and some applications
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing with due-dates and early start times to minimize maximum tardiness
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
