scientific article

From MaRDI portal
Publication:3970631

DOI<981::AID-NAV3220370617>3.0.CO;2-H 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-HzbMath0825.90551MaRDI QIDQ3970631

Richard L. Daniels, Robert J. Chambers

Publication date: 25 June 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Two-machine flow shop scheduling with two criteria: maximum earliness and makespanIncorporating preference information into multi-objective schedulingEfficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardinessSolving permutation flow shop scheduling problem with sequence-independent setup timeScheduling on a two-machine flowshop subject to random breakdowns with a makespan objective functionNo-wait flowshops with bicriteria of makespan and maximum lateness.Pareto optima for total weighted completion time and maximum lateness on a single machineAn effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffersA bicriteria flowshop scheduling with a learning effectMinimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardinessA new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardinessA hierarchical bicriterion approach to integrated process plan selection and job shop schedulingMulticriteria scheduling problems: a surveySetting a common due date in a constrained flowshop: a variable neighbourhood search approachA grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardinessBi-objective parallel machine scheduling with additional resources during setupsA novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problemsFlowshop-scheduling problems with makespan criterion: a reviewA bicriteria approach to the two-machine flow shop scheduling problemExploiting process plan flexibility in production scheduling: A multi-objective approachCounting and enumeration complexity with application to multicriteria schedulingGenetic algorithms for the two-stage bicriteria flowshop problemGenetic local search for multi-objective flowshop scheduling problemsA multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobsEmpirically discovering dominance relations for scheduling problems using an evolutionary algorithm