An investigation on a two-agent single-machine scheduling problem with unequal release dates
From MaRDI portal
(Redirected from Publication:339650)
Recommendations
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Two-agent scheduling on a single machine with release dates
- Two-agent scheduling problem about tardiness on a single machine
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- A two-agent single-machine scheduling problem with late work criteria
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A comparative study of artificial bee colony algorithm
- A decomposition algorithm for the single machine total tardiness problem
- A dual algorithm for the one-machine scheduling problem
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
- A multiple-criterion model for machine scheduling
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A two-machine flowshop problem with two agents
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Competitive two-agent scheduling and its applications
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- Minimizing total tardiness on a single machine with unequal release dates
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- On decomposition of the total tardiness problem
- On general routing problems
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling two agents with controllable processing times
- Solution of the single machine total tardiness problem
- Solving a two-agent single-machine scheduling problem considering learning effect
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- The single-machine total tardiness scheduling problem: review and extensions
- The two-machine total completion time flow shop problem
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Using artificial bees to solve partitioning and scheduling problems in codesign
Cited in
(12)- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
- Two-agent single machine scheduling with forbidden intervals
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- A survey of due-date related single-machine with two-agent scheduling problem
- A lower bound for minimizing the total completion time of a three-agent scheduling problem
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- A mixed integer programming approach for the single machine problem with unequal release dates
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
This page was built for publication: An investigation on a two-agent single-machine scheduling problem with unequal release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339650)
