Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
From MaRDI portal
Publication:454994
DOI10.1016/j.ins.2011.11.035zbMath1247.90165OpenAlexW2076702721MaRDI QIDQ454994
Yunqiang Yin, Shuenn-Ren Cheng, Chin-Chia Wu
Publication date: 2 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.11.035
Related Items
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ A scheduling problem with three competing agents ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Single-machine multitasking scheduling with job efficiency promotion ⋮ A branch and bound algorithm for project scheduling problem with spatial resource constraints ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-agent scheduling of time-dependent jobs ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ 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 ⋮ Single-machine group scheduling problems with deterioration to minimize the sum of completion times ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Two-agent scheduling to minimize the maximum cost with position-dependent jobs ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time ⋮ A just-in-time scheduling problem with two competing agents ⋮ Four single-machine scheduling problems involving due date determination decisions ⋮ Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities ⋮ Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine ⋮ Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A Batch Scheduling Problem with Two Agents ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ Single machine group scheduling with time dependent processing times and ready times ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs ⋮ An Ordered Flow Shop with Two Agents ⋮ One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations
Cites Work
- Unnamed Item
- Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent 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
- Scheduling problems with general effects of deterioration and learning
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- A two-machine flowshop problem with two agents
- Rescheduling problems with deteriorating jobs under disruptions
- A note on single-machine scheduling with decreasing time-dependent job processing times
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Note on ``Single-machine and flowshop scheduling with a general learning effect model and ``Some single-machine and m-machine flowshop scheduling problems with learning considerations
- Scheduling jobs under decreasing linear deterioration
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Complexity of scheduling tasks with time-dependent execution times
- A concise survey of scheduling with time-dependent processing times
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- 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
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Batching work and rework processes with limited deterioration of reworkables
- Scheduling with time dependent processing times: Review and extensions
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling start time dependent jobs to minimize the total weighted completion time
This page was built for publication: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
