Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

DOI10.1016/J.INS.2011.11.035MaRDI QIDQ454994zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

schedulingdeteriorationsingle-machinetwo agents

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• scientific article; zbMATH DE number 7618570 (Why is no real title available?)
• A concise survey of scheduling with time-dependent processing times
• A multiple-criterion model for machine scheduling
• A note on single-machine scheduling with decreasing time-dependent job processing times
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
• A two-machine flowshop problem with two agents
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Batching work and rework processes with limited deterioration of reworkables
• Complexity of scheduling tasks with time-dependent execution times
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• 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
• Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
• Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
• Rescheduling problems with deteriorating jobs under disruptions
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
• Scheduling Problems with Two Competing Agents
• Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
• Scheduling jobs under decreasing linear deterioration
• Scheduling problems with general effects of deterioration and learning
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Scheduling two agents with controllable processing times
• Scheduling with time dependent processing times: Review and extensions
• Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
• Two-agent single-machine scheduling problems under increasing linear deterioration
• Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time

Cited in

(39)

• Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
• Two-agent single-machine scheduling with assignable due dates
• An ordered flow shop with two agents
• A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
• Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities
• A batch scheduling problem with two agents
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Two-machine and two-agent flow shop with special processing times structures
• Two-agent single machine scheduling with forbidden intervals
• 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
• A just-in-time scheduling problem with two competing agents
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
• Single machine group scheduling with time dependent processing times and ready times
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Two-agent single-machine scheduling problems under increasing linear deterioration
• 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 problems with deterioration to minimize the sum of completion times
• Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
• Four single-machine scheduling problems involving due date determination decisions
• Scheduling with two competing agents to minimize total weighted earliness
• One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations
• Single machine two-agent scheduling with deteriorating jobs
• Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• Two-agent scheduling of time-dependent jobs
• 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
• A two-agent single-machine scheduling problem with late work criteria
• Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
• A two-agent single-machine scheduling problem to minimize the total cost with release dates
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
• Single-machine multitasking scheduling with job efficiency promotion
• Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria

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)