Due date-related scheduling with two agents. Models and algorithms

DOI10.1007/978-981-15-2105-8zbMath1439.90038OpenAlexW3007755478MaRDI QIDQ2303121

Yunqiang Yin, Cheng, T. C. Edwin, Du-Juan Wang

Publication date: 2 March 2020

Published in: Uncertainty and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-2105-8

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times ⋮ Two-Agent Scheduling with Resource Augmentation on Multiple Machines ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

This page was built for publication: Due date-related scheduling with two agents. Models and algorithms