A survey of due-date related single-machine with two-agent scheduling problem
DOI10.3934/jimo.2019005zbMath1449.90110OpenAlexW2921133636WikidataQ128151145 ScholiaQ128151145MaRDI QIDQ2190270
Yuvraj Gajpal, C. R. Bector, Hong-Wei Li
Publication date: 18 June 2020
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2019005
due datenumber of tardy jobsearliness and tardinesstwo-agent schedulingmaximum latenesssurvey (literature review)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (3)
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- A single-machine bi-criterion scheduling problem with two agents
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Approximation algorithms for scheduling a single machine to minimize total late work
- Scheduling preemptable tasks on parallel processors with limited availability
- A two-agent single-machine scheduling problem with late work criteria
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Scheduling aircraft landings using airlines' preferences
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Single Machine Scheduling to Minimize Total Late Work
- Some simple scheduling algorithms
- Single machine just‐in‐time scheduling problems with two competing agents
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Reducibility among Combinatorial Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Scheduling
This page was built for publication: A survey of due-date related single-machine with two-agent scheduling problem
