CON/SLK due date assignment and scheduling on a single machine with two agents

DOI10.1002/nav.21700zbMath1411.90166OpenAlexW2516974190MaRDI QIDQ4632940

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

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.21700

zbMATH Keywords

schedulingdue date assignmenttwo agents

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (23)

Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ Proportionate flowshop scheduling with position-dependent weights ⋮ Multitasking scheduling problems with two competitive agents ⋮ Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A just-in-time scheduling problem with two competing agents ⋮ Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights ⋮ Minmax due-date assignment on a two-machine flowshop ⋮ Bicriterion scheduling with a negotiable common due window and resource-dependent processing times ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads ⋮ A unified analysis for scheduling problems with variable processing times ⋮ Due date assignment and two-agent scheduling under multitasking environment ⋮ Due-window assignment scheduling with learning and deterioration effects ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

This page was built for publication: CON/SLK due date assignment and scheduling on a single machine with two agents