A survey of due-date related single-machine with two-agent scheduling problem
From MaRDI portal
Publication:2190270
Recommendations
- Two-agent single-machine scheduling with assignable due dates
- CON/SLK due date assignment and scheduling on a single machine with two agents
- Due date-related scheduling with two agents. Models and algorithms
- Single machine just‐in‐time scheduling problems with two competing agents
- Two-agent scheduling problem about tardiness on a single machine
Cites work
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A multiple-criterion model for machine scheduling
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A single-machine bi-criterion scheduling problem with two agents
- A single-machine scheduling problem with two-agent and deteriorating jobs
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- A two-agent single-machine scheduling problem with late work criteria
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Approximation algorithms for scheduling a single machine to minimize total late work
- Competitive two-agent scheduling and its applications
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- Multi-agent scheduling on a single machine with max-form criteria
- Optimization by simulated annealing
- Reducibility among combinatorial problems
- Scheduling aircraft landings using airlines' preferences
- Scheduling preemptable tasks on parallel processors with limited availability
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Scheduling. Theory, algorithms, and systems.
- Single machine just‐in‐time scheduling problems with two competing agents
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Some simple scheduling algorithms
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
Cited in
(7)- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Pareto-scheduling of two competing agents with their own equal processing times
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Two-agent single-machine scheduling with assignable due dates
- Due date-related scheduling with two agents. Models and algorithms
- CON/SLK due date assignment and scheduling on a single machine with two agents
- 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: A survey of due-date related single-machine with two-agent scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190270)
