An Improved Algorithm for a Bicriteria Batching Scheduling Problem

DOI10.1051/ro/2012023zbMath1271.90033OpenAlexW1993807656MaRDI QIDQ2845028

Yundong Mu, Cheng He, Xiumei Wang, Yanpei Liu

Publication date: 22 August 2013

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2013__47_1_1_0/

zbMATH Keywords

Pareto optimal solutionsbatching machinemulticriteria schedulingmaximum cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices ⋮ Bounded serial-batching scheduling for minimizing maximum lateness and makespan ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost

This page was built for publication: An Improved Algorithm for a Bicriteria Batching Scheduling Problem