Trade-off balancing in scheduling for flow shop production and perioperative processes
type: Item
instance of: scholarly article
title: Trade-off balancing in scheduling for flow shop production and perioperative processes
zbMATH Open document ID: 1403.90343
author: Wei Li
author: Barrie R. Nault
author: Honghan Ye
published in: European Journal of Operational Research
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6989912
zbMATH Keywords: flow shop production
zbMATH Keywords: perioperative process
zbMATH Keywords: scheduling
zbMATH Keywords: trade-off balancing
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.08.048
OpenAlex ID: W2890510167
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Carbon-efficient scheduling of flow shops by multi-objective optimization
cites work: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
cites work: A parallel multiple reference point approach for multi-objective optimization
cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
cites work: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
cites work: Energy-efficient scheduling in manufacturing companies: a review and research framework
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Flowshop scheduling research after five decades
cites work: Flowshop sequencing with mean flowtime objective
cites work: Minimizing total completion time in a two-machine flowshop: Analysis of special cases
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Minimizing total tardiness in permutation flowshops
cites work: An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production
cites work: Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
cites work: Scheduling
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Benchmarks for basic scheduling problems
cites work: Q3425494
Wikidata QID: Q129327842
DOI: 10.1016/J.EJOR.2018.08.048
description: scientific article; zbMATH DE number 6989912