Scheduling problems with two competing agents to minimized weighted earliness-tardiness
From MaRDI portal
Publication:339552
DOI10.1016/j.cor.2012.05.019zbMath1349.90347OpenAlexW2089465700MaRDI QIDQ339552
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.019
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (14)
Pareto-scheduling of two competing agents with their own equal processing times ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Two-agent parallel-machine scheduling with rejection ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Two-agent vehicle scheduling problem on a line-shaped network ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ 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
Cites Work
- Single machine batch scheduling with two competing agents to minimize total flowtime
- A two-machine flowshop problem with two agents
- Due dates assignment and JIT scheduling with equal-size jobs
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Minmax scheduling problems with a common due-window
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Solving a two-agent single-machine scheduling problem considering learning effect
- Common due date assignment and scheduling with ready times
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Due-date assignment on uniform machines
- Competitive Two-Agent Scheduling and Its Applications
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling Problems with Two Competing Agents
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- The parallel machine min-max weighted absolute lateness scheduling problem
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Minmax earliness-tardiness costs with unit processing time jobs
This page was built for publication: Scheduling problems with two competing agents to minimized weighted earliness-tardiness
