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.035zbMATH Open1247.90165OpenAlexW2076702721MaRDI QIDQ454994FDOQ454994
Authors: 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
Recommendations
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- A two-agent scheduling problem with deterioration
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Scheduling Problems with Two Competing Agents
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Complexity of scheduling tasks with time-dependent execution times
- Batching work and rework processes with limited deterioration of reworkables
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
- A two-machine flowshop problem with two agents
- Scheduling two agents with controllable processing times
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Scheduling problems with general effects of deterioration and learning
- Rescheduling problems with deteriorating jobs under disruptions
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- Scheduling jobs under decreasing linear deterioration
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Title not available (Why is that?)
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- 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
- A note on single-machine scheduling with decreasing time-dependent job processing times
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
Cited In (39)
- Two-agent single-machine scheduling with assignable due dates
- A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
- 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 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
- Four single-machine scheduling problems involving due date determination decisions
- A just-in-time scheduling problem with two competing agents
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Single machine group scheduling with time dependent processing times and ready times
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Scheduling with two competing agents to minimize total weighted earliness
- Two-agent scheduling of time-dependent jobs
- An ordered flow shop with two agents
- A batch scheduling problem with two agents
- Two-machine and two-agent flow shop with special processing times structures
- Single machine two-agent scheduling with deteriorating jobs
- Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities
- 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 scheduling problem with three competing agents
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- A branch and bound algorithm for project scheduling problem with spatial resource constraints
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Single-machine multitasking scheduling with job efficiency promotion
- Two-agent single machine scheduling with forbidden intervals
- Two-agent single-machine scheduling problems under increasing linear deterioration
- One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations
- A two-agent single-machine scheduling problem with late work criteria
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- Single-machine group scheduling problems with deterioration to minimize the sum of completion times
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
- 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
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
This page was built for publication: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454994)
