Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
From MaRDI portal
Publication:3430246
DOI10.1080/00207540600619700zbMath1114.90372OpenAlexW2053774870MaRDI QIDQ3430246
Fawaz S. Al-Anzi, Ali Allahverdi
Publication date: 21 March 2007
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600619700
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic, A survey of scheduling problems with setup times or costs
Cites Work
- Unnamed Item
- Unnamed Item
- Job lateness in a two-machine flowshop with setup times separated
- The two-machine total completion time flow shop problem
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- A decomposition algorithm for the single machine total tardiness problem
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- A note on defective units in an inventory model with sub-lot sampling inspection for variable lead-time demand with the mixture of free distributions
- Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
- Heuristic optimization system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
- A flexible flowshop problem with total flow time minimization
- Tabu search for a class of single-machine scheduling problems
