Open shop scheduling with makespan and total completion time criteria
From MaRDI portal
(Redirected from Publication:1818565)
Recommendations
- Open shop scheduling with some additional constraints
- Open shop scheduling with machine dependent processing times
- Open shop scheduling problem to minimize makespan with release dates
- Scheduling open shops with parallel machines to minimize total completion time
- Scheduling Unit-Time Open Shops with Deadlines
- The open shop scheduling problem
- Open shop scheduling with synchronization
- Open shop scheduling with delays
- Flexible open shop scheduling problem to minimize makespan
- Openshop and flowshop scheduling to minimize sum of completion times
Cited in
(12)- Counting and enumeration complexity with application to multicriteria scheduling
- Scheduling open shops with parallel machines to minimize total completion time
- Open shops with jobs overlap -- revisited
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- A new heuristic for open shop total completion time problem
- Openshop and flowshop scheduling to minimize sum of completion times
- Open shop scheduling with machine dependent processing times
- New efficient heuristics for scheduling open shops with makespan minimization
- Multicriteria scheduling
- Open shop problem to minimize the total weighted completion time
- Two-machine open shop scheduling with secondary criteria
This page was built for publication: Open shop scheduling with makespan and total completion time criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818565)
