Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

DOI10.1080/00207540600619700MaRDI QIDQ3430246zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

dominance relationsflowshopmaximum latenessmultimediaschedulingworld wide web

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Generating improved dominance conditions for the flowshop problem
• Evolutionary algorithms for jobshop scheduling
• ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• A characterization of optimal multiprocessor schedules and new dominance rules

Cites work

• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• A decomposition algorithm for the single machine total tardiness problem
• A flexible flowshop problem with total flow time minimization
• A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• 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
• Heuristic optimization system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications
• scientific article; zbMATH DE number 7722 (Why is no real title available?)
• scientific article; zbMATH DE number 40477 (Why is no real title available?)
• Job lateness in a two-machine flowshop with setup times separated
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Tabu search for a class of single-machine scheduling problems
• The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• The two-machine total completion time flow shop problem
• Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

Cited in

(3)

• A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems
• 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

This page was built for publication: Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430246)