Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives

DOI10.3934/nhm.2023073OpenAlexW4387109930MaRDI QIDQ6186161

Shuguang Li, Mingsong Li, Muhammad Ijaz Khan

Publication date: 2 February 2024

Published in: Networks and Heterogeneous Media (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/nhm.2023073

zbMATH Keywords

two-agent schedulingmaximum latenessbatch/item availabilitycompatibility/incompatibilityunbounded serial-batch

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
• The third comprehensive survey on scheduling problems with setup times/costs
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine
• Improved dynamic programs for some batching problems involving the maximum lateness criterion
• Spectral properties of the matrix splitting preconditioners for generalized saddle point problems
• Bounded serial-batching scheduling for minimizing maximum lateness and makespan
• Scheduling with batching: A review
• A survey of scheduling with parallel batch (p-batch) processing
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• A multiple-criterion model for machine scheduling
• Multicriteria scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Two‐agent scheduling on a single sequential and compatible batching machine
• Scheduling Groups of Jobs on a Single Machine
• Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
• Multiagent Scheduling

This page was built for publication: Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives