Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine

MaRDI QIDQ5142948zbMATH OpenFDO

Authors Cheng He, Xinxin Han

Publication date 14 January 2021

zbMATH Keywords

computational complexitymakespanserial-batchingtotal completion timetwo-agent scheduling

Mathematics Subject Classification ID

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

Recommendations

• Two-agent scheduling on an unbounded serial batching machine
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine

Cited in

(9)

• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• 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
• Two-agent scheduling on an unbounded serial batching machine
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Two-agent scheduling on a single sequential and compatible batching machine
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine

This page was built for publication: Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine

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