Two-agent single-machine scheduling with assignable due dates
From MaRDI portal
Publication:2250186
DOI10.1016/j.amc.2012.08.008zbMath1291.90102OpenAlexW2058459342MaRDI QIDQ2250186
Wen-Hsiang Wu, Chin-Chia Wu, Shuenn-Ren Cheng, Yunqiang Yin, Cheng, T. C. Edwin
Publication date: 4 July 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.08.008
Related Items
Multitasking scheduling problems with two competitive agents ⋮ A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Single machine scheduling with rejection and generalized parameters ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ 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 ⋮ A note on two-agent scheduling with resource dependent release times on a single machine ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two-agent scheduling on a single machine with release dates ⋮ A Batch Scheduling Problem with Two Agents ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates ⋮ An Ordered Flow Shop with Two Agents ⋮ On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Cites Work
- Unnamed Item
- Single machine batch scheduling with two competing agents to minimize total flowtime
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Single machine multiple common due dates scheduling with learning effects
- A note on the scheduling with two families of jobs
- A due-date assignment problem with learning effect and deteriorating jobs
- Scheduling two agents with controllable processing times
- 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
- Survey of scheduling research involving due date determination decisions
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine scheduling with assignable due dates
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- 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
- Due-date assignment and maintenance activity scheduling problem
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
