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.90073MaRDI QIDQ1083026
Eugeniusz Nowicki, Jozef Grabowski, Stanisław Zdrzałka
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
branch-and-bound; release dates; due dates; maximum lateness; one machine; scheduling deterministic tasks
65K05: Numerical mathematical programming methods
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, On the heuristic solution of the permutation flow shop problem by path algorithms, Tabu search algorithms for job-shop problems with a single transport robot, New single machine and job-shop scheduling problems with availability constraints, An algorithm for single machine sequencing with release dates to minimize maximum cost, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis, 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, An approximation algorithm for a single-machine scheduling problem with release times and delivery times, 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, 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 production rescheduling expert simulation system, Sequencing of jobs in some production system, Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems, A tabu search algorithm for scheduling a single robot in a job-shop environment, Deterministic job-shop scheduling: Past, present and future, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, A sequencing problem with family setup times, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Problems of discrete optimization: challenges and main approaches to solve them, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Effective heuristics for the single machine sequencing problem with ready times, Improving earliest starting times in machine scine scheduling problem, Unnamed Item
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
