A two-agent single-machine scheduling problem with late work criteria
From MaRDI portal
Recommendations
- Two-agent scheduling problem about total late work on a single machine
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Two-agent scheduling problem about tardiness on a single machine
- Two-agent single machine scheduling problem with the total weighted early work
- A single-machine bi-criterion scheduling problem with two agents
- A single-machine scheduling problem with two-agent and deteriorating jobs
- scientific article; zbMATH DE number 6531341
- A note on a two-agent scheduling problem related to the total weighted late work
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Two-agent single-machine scheduling problem with just-in-time jobs
Cites work
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
- 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 time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- A two-machine flowshop problem with two agents
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Approximation algorithms for scheduling a single machine to minimize total late work
- Approximation schemes for two-agent scheduling on parallel machines
- Competitive two-agent scheduling and its applications
- Coordination of production and transportation in supply chain scheduling
- Dominance relations for two-machine flow shop problem with late work criterion
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- scientific article; zbMATH DE number 1594554 (Why is no real title available?)
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- Open shop scheduling problems with late work criteria.
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- 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 with controllable processing times
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Single Machine Scheduling to Minimize Total Late Work
- Single-machine multi-agent scheduling problems with a global objective function
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Tabu Search—Part I
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Two-agent single-machine scheduling with assignable due dates
- Two-machine scheduling with periodic availability constraints to minimize makespan
- Unbounded parallel-batching scheduling with two competitive agents
Cited in
(22)- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Pareto-scheduling of two competing agents with their own equal processing times
- A survey of due-date related single-machine with two-agent scheduling problem
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A note on a two-agent scheduling problem related to the total weighted late work
- Scheduling with competing agents, total late work and job rejection
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Two-machine flow-shop scheduling to minimize total late work: revisited
- Two-agent scheduling problem about total late work on a single machine
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
- A new perspective on single-machine scheduling problems with late work related criteria
- Two-agent scheduling of minimizing total weighted late work and maximum cost
- Scheduling with assignable due dates, two competing agents and late work related criteria
- Minimizing total weighted late work in a proportionate flow shop with job rejection
This page was built for publication: A two-agent single-machine scheduling problem with late work criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701708)
