Two-agent scheduling on a single sequential and compatible batching machine

DOI10.1002/NAV.21779MaRDI QIDQ4632997zbMATH OpenOpenAlexFDO

Authors

Publication date 2 May 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21779

zbMATH Keywords

dynamic programmingfptassequential and compatible batchsingle-machine schedulingtwo agents

Mathematics Subject Classification ID

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

Recommendations

• Two-agent scheduling on an unbounded serial batching machine
• Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine
• A batch scheduling problem with two agents
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine
• Single machine batch scheduling with two competing agents to minimize total flowtime

Cited in

(18)

• Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• 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
• Scheduling with release dates and preemption to minimize multiple max-form objective functions
• Two-agent scheduling with rejection on a single machine
• A batch scheduling problem with two agents
• scientific article; zbMATH DE number 6531341 (Why is no real title available?)
• Single machine batch scheduling with two competing agents to minimize total flowtime
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
• Multitasking scheduling problems with two competitive agents
• Group Scheduling with Two Competing Agents on a Single Machine
• Competitive two-agent scheduling with release dates and preemption on a single machine
• Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
• A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor
• Fifty years of research in scheduling -- theory and applications
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent

This page was built for publication: Two-agent scheduling on a single sequential and compatible batching machine

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