Improved algorithms for two-agent scheduling on an unbounded serial-batching machine

DOI10.1016/J.DISOPT.2021.100655MaRDI QIDQ2234745zbMATH OpenOpenAlexFDO

Authors Cheng He, Hao Lin

Publication date 19 October 2021

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2021.100655

zbMATH Keywords

maximum latenessmakespantotal completion timeagent schedulingserial-batching machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
• Two-agent scheduling on an unbounded serial batching machine
• Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
• scientific article; zbMATH DE number 7109369
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• A DP algorithm for minimizing makespan and total completion time on a series-batching machine
• Batch sizing and job sequencing on a single machine
• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Bounded serial-batching scheduling for minimizing maximum lateness and makespan
• Multiagent scheduling. Models and algorithms
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• Scheduling Groups of Jobs on a Single Machine
• Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine

Cited in

(7)

• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
• scientific article; zbMATH DE number 7109369 (Why is no real title available?)
• Two-agent scheduling on an unbounded serial batching machine
• Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
• Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives

This page was built for publication: Improved algorithms for two-agent scheduling on an unbounded serial-batching machine

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