Scheduling problems with two competing agents to minimized weighted earliness-tardiness
From MaRDI portal
(Redirected from Publication:339552)
Recommendations
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling with two competing agents to minimize total weighted earliness
- Single machine just‐in‐time scheduling problems with two competing agents
- Scheduling Problems with Two Competing Agents
- Competitive two-agent scheduling and its applications
Cites work
- 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 two-machine flowshop problem with two agents
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Common due date assignment and scheduling with ready times
- Competitive two-agent scheduling and its applications
- Due dates assignment and JIT scheduling with equal-size jobs
- Due-date assignment on uniform machines
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Minmax earliness-tardiness costs with unit processing time jobs
- Minmax scheduling problems with a common due-window
- Multi-agent scheduling on a single machine with max-form criteria
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Solving a two-agent single-machine scheduling problem considering learning effect
- The parallel machine min-max weighted absolute lateness scheduling problem
Cited in
(24)- Minimizing weighted earliness and tardiness on parallel machines using a multi-agent system
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Two-agent scheduling problem about tardiness on a single machine
- A survey of due-date related single-machine with two-agent scheduling problem
- Two competitive agents to minimize the weighted total late work and the total completion time
- CON/SLK due date assignment and scheduling on a single machine with two agents
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Scheduling with two competing agents to minimize total weighted earliness
- Pareto-scheduling of two competing agents with their own equal processing times
- Competitive two-agent scheduling and its applications
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Two-agent parallel-machine scheduling with rejection
- A two-agent single-machine scheduling problem with late work criteria
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Two-agent vehicle scheduling problem on a line-shaped network
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Scheduling Problems with Two Competing Agents
- Two-agent single-machine scheduling with release dates to minimize the makespan
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
This page was built for publication: Scheduling problems with two competing agents to minimized weighted earliness-tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339552)
