Heuristics for the two-machine scheduling problem with a single server
From MaRDI portal
Recommendations
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Two-machine flow shop problems with a single server
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- Scheduling two parallel machines with a single server: the general case
- A heuristic algorithm for open-shop scheduling problems with a single server
Cited in
(14)- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- The CLWS heuristic for single machine scheduling problem
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints
- Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- scientific article; zbMATH DE number 777705 (Why is no real title available?)
- Scheduling with day shifts and breaks
- Short‐term scheduling with machine calibration
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- A reduction approach for the parallel machine scheduling problem with a separate server for loading and unloading operations
- Improved algorithms for two single machine scheduling problems
- Two-machine flow shop problems with a single server
This page was built for publication: Heuristics for the two-machine scheduling problem with a single server
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601631)
