The competing job sets scheduling problems with two types of release dates on batching machine

DOI10.16383/J.AAS.2018.C170536zbMATH Open1449.90129WikidataQ118421259 ScholiaQ118421259MaRDI QIDQ3307381FDOQ3307381

Authors Xiaoli Zhao, Hua Gong, Ping Che

Publication date 12 August 2020

zbMATH Keywords

schedulingrelease datebatching machinecompeting job sets

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Batching identical jobs
• Two-agent scheduling on an unbounded serial batching machine
• Unbounded parallel-batching scheduling with two competitive agents
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
• Bounded parallel-batching scheduling with two competing agents

Cited in

(2)

• Competitive project scheduling on two unbounded parallel batch machines
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan

This page was built for publication: The competing job sets scheduling problems with two types of release dates on batching machine

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