The total completion time open shop scheduling problem with a given sequence of jobs on one machine
From MaRDI portal
Publication:1603323
DOI10.1016/S0305-0548(01)00028-4zbMath0994.90062OpenAlexW2045841722MaRDI QIDQ1603323
Ching-Fang Liaw, Chun-Yuan Cheng, Ming-Chih Chen
Publication date: 11 July 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00028-4
Related Items
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ Heuristic constructive algorithms for open shop scheduling to minimize mean flow time ⋮ A new heuristic for open shop total completion time problem
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for the multiple knapsack problem
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Constructive heuristic algorithms for the open shop problem
- Shop scheduling problems under precedence constraints
- A branch \(\&\) bound algorithm for the open-shop problem
- A new lower bound for the open-shop problem
- Benchmarks for basic scheduling problems
- Scheduling the Open Shop to Minimize Mean Flow Time
- Open Shop Scheduling to Minimize Finish Time
- The open shop scheduling problem with a given sequence of jobs on one machine
- Algorithms for Solving Production-Scheduling Problems