Due date assignment and two-agent scheduling under multitasking environment

DOI10.1007/S10878-020-00600-5MaRDI QIDQ2084604zbMATH OpenOpenAlexFDO

Authors Guangqiang Yin, Chunyu Wang, Yunqiang Yin, Yongjian 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

zbMATH Keywords

dynamic programmingtwo agentsDIF due date assignmentmultitasking scheduling

Mathematics Subject Classification ID

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

Recommendations

• Multitasking scheduling problems with two competitive agents
• \(CON/SLK\) due date assignment and scheduling on a single machine with two agents
• Optimal due date assignment in multi-machine scheduling environments
• Two-agent single-machine scheduling with assignable due dates
• Multitasking scheduling problems with a common due-window

Cites work

• 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
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Competitive two-agent scheduling and its applications
• Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
• Multitasking scheduling problems with two competitive agents
• Multitasking scheduling with multiple rate‐modifying activities
• Multitasking via alternate and shared processing: algorithms and complexity
• Scheduling Problems with Two Competing Agents
• Scheduling two agents with controllable processing times
• Single machine just‐in‐time scheduling problems with two competing agents
• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• \(CON/SLK\) due date assignment and scheduling on a single machine with two agents

Cited in

(3)

• Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
• Multitasking scheduling problems with two competitive agents
• Multitasking scheduling with alternate periods

This page was built for publication: Due date assignment and two-agent scheduling under multitasking environment

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