Bi-objective scheduling on a restricted batching machine

DOI10.1016/J.COR.2018.07.004MaRDI QIDQ1782176zbMATH OpenOpenAlexWikidataFDO

Authors Marta Cabo, José Luis González-Velarde, Edgar Possani, Y. 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

integer linear programmingschedulingbatching machineBRKGA

Mathematics Subject Classification ID

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

Recommendations

• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan

Cites work

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

Cited in

(3)

• Logic-based Benders decomposition for scheduling a batching machine
• 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

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

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