Bi-objective scheduling on a restricted batching machine

DOI10.1016/j.cor.2018.07.004zbMath1458.90269OpenAlexW2881427397WikidataQ129642722 ScholiaQ129642722MaRDI QIDQ1782176

José Luis González-Velarde, Marta Cabo, Edgar Possani, Yasmin A. Rios-Solis

Publication date: 18 September 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.004

zbMATH Keywords

schedulinginteger linear programmingbatching machineBRKGA

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Logic-based Benders decomposition for scheduling a batching machine

Cites Work

• Unnamed Item
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• A biased random key genetic algorithm for the field Technician scheduling problem
• A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
• Bi-criteria scheduling on a single parallel-batch machine
• Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
• Optimal methods for batch processing problem with makespan and maximum lateness objectives
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Scheduling a batching machine
• Bounded serial-batching scheduling for minimizing maximum lateness and makespan
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
• Multicriteria scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Randomized heuristics for the family traveling salesperson problem

This page was built for publication: Bi-objective scheduling on a restricted batching machine