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

DOI10.1002/nav.21779zbMath1411.90151OpenAlexW2790229059MaRDI QIDQ4632997

No author found.

Publication date: 2 May 2019

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

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

zbMATH Keywords

single-machine schedulingdynamic programmingtwo agentsfptassequential and compatible batch

Mathematics Subject Classification ID

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

Related Items (8)

Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Multitasking scheduling problems with two competitive agents ⋮ 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 ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions

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