Two-agent scheduling on an unbounded serial batching machine

DOI10.1007/978-3-642-32147-4_38MaRDI QIDQ3167645zbMATH OpenOpenAlexFDO

Authors M. Y. Kovalyov, A. Oulamara, A. Soukhal

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_38

zbMATH Keywords

complexitydynamic programmingmulti-agentschedulingserial batching machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Two-agent scheduling with agent specific batches on an unbounded serial batching machine
• Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
• Unbounded parallel-batching scheduling with two competitive agents
• Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine

Cited in

(17)

• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• Single machine batch scheduling with two non-disjoint agents and splitable jobs
• 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
• Unbounded parallel-batching scheduling with two competitive agents
• Bounded parallel-batching scheduling with two competing agents
• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
• A batch scheduling problem with two agents
• Scheduling on Two Unbounded Resources with Communication Costs
• The competing job sets scheduling problems with two types of release dates on batching machine
• Two-agent scheduling on a single sequential and compatible 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
• scientific article; zbMATH DE number 7109369 (Why is no real title available?)
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine

This page was built for publication: 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 Q3167645)