An improved algorithm for a bicriteria batching scheduling problem

DOI10.1051/RO/2012023MaRDI QIDQ2845028zbMATH OpenOpenAlexFDO

Authors Cheng He, Xiumei Wang, Yundong Mu, Yixun Lin

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

batching machinemaximum costmulticriteria schedulingPareto optimal solutions

Mathematics Subject Classification ID

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

Recommendations

• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• A bicriteria batch scheduling on a serial-batching machine
• Batching machine scheduling with bicriteria: maximum cost and makespan
• An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan

Cited in

(6)

• 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
• Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
• Minimizing bicriteria scheduling of two-component jobs on a bounded series-batching machine
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan

This page was built for publication: An improved algorithm for a bicriteria batching scheduling problem

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