Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost

DOI10.1016/J.IPL.2022.106343OpenAlexW4309777703MaRDI QIDQ2680241

Shuguang Li, Zhichao Geng

Publication date: 30 January 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106343

zbMATH Keywords

schedulingPareto optimizationprecedencemaximum costunbounded parallel-batch

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on unbounded parallel-batch scheduling
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Scheduling a batching machine
• On scheduling an unbounded batch machine
• Scheduling with batching: A review
• A survey of scheduling with parallel batch (p-batch) processing
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• Multicriteria scheduling
• Optimal Batch Schedules for Parallel Machines
• BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine parallel batch scheduling subject to precedence constraints
• Approximation Methods for Multiobjective Optimization Problems: A Survey

This page was built for publication: Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost