Due date assignment and two-agent scheduling under multitasking environment
From MaRDI portal
Publication:2084604
DOI10.1007/s10878-020-00600-5zbMath1503.90050OpenAlexW3034321125MaRDI QIDQ2084604
Yunqiang Yin, Chunyu Wang, Guangqiang Yin, Yong-jian Yang
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00600-5
Related Items (2)
Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs ⋮ Multitasking scheduling with alternate periods
Cites Work
- Multitasking via alternate and shared processing: algorithms and complexity
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Scheduling two agents with controllable processing times
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A multiple-criterion model for machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- Scheduling Problems with Two Competing Agents
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Single machine just‐in‐time scheduling problems with two competing agents
- CON/SLK due date assignment and scheduling on a single machine with two agents
- Multitasking scheduling problems with two competitive agents
- Multitasking scheduling with multiple rate‐modifying activities
This page was built for publication: Due date assignment and two-agent scheduling under multitasking environment
