Heuristics for a coupled-operation scheduling problem
From MaRDI portal
Recommendations
- Scheduling coupled-operation jobs with exact time-lags
- Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
- Two-machine flowshop scheduling problem with coupled-operations
- A flowshop scheduling problem with two operations per job
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
Cited in
(13)- The coupled unit-time operations problem on identical parallel machines with respect to the makespan
- Coupled task scheduling with exact delays: literature review and models
- Two-machine flowshop scheduling problem with coupled-operations
- Dynamic supply chain scheduling
- Operational planning in service control towers -- heuristics and case study
- Aggregation heuristic for the open-pit block scheduling problem
- scientific article; zbMATH DE number 5669804 (Why is no real title available?)
- A branch-and-bound algorithm for the coupled task problem
- Polynomial-time approximation schemes for scheduling problems with time lags
- Scheduling of coupled tasks with unit processing times
- Scheduling coupled-operation jobs with exact time-lags
- Two-machine interval shop scheduling with time lags
- Scheduling of coupled tasks and one-machine no-wait robotic cells
This page was built for publication: Heuristics for a coupled-operation scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512387)
