A single-machine scheduling problem with two-agent and deteriorating jobs
From MaRDI portal
Publication:611543
DOI10.1016/j.apm.2010.01.015zbMath1201.90080MaRDI QIDQ611543
Publication date: 14 December 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2010.01.015
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
Single Machine Two-Agent Scheduling with Deteriorating Jobs, Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, 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, Two-agent singe-machine scheduling with release times to minimize the total weighted completion time, Single machine scheduling problem with two synergetic agents and piece-rate maintenance, Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration, A single-machine bi-criterion scheduling problem with two agents, Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties, Two-agent scheduling with position-based deteriorating jobs and learning effects, Single-machine scheduling with deteriorating functions for job processing times, Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning, Isomorphic scheduling problems, Parallel-machine scheduling with non-simultaneous machine available time, Single-machine scheduling problems with an actual time-dependent deterioration, A lower bound for minimizing the total completion time of a three-agent scheduling problem, Two-agent scheduling problems on a single-machine to minimize the total weighted late work, Scheduling two agents with sum-of-processing-times-based deterioration on a single machine, A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH
Cites Work
- A note on the scheduling with two families of jobs
- Time-dependent scheduling
- Learning effect and deteriorating jobs in the single machine scheduling problems
- A note on single-machine scheduling with decreasing time-dependent job processing times
- A due-date assignment problem with learning effect and deteriorating jobs
- Scheduling jobs under decreasing linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Single-machine group scheduling problems with deterioration consideration
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Deteriorating Jobs on a Single Processor
- Single machine scheduling with time deteriorating job values
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Scheduling Problems with Two Competing Agents
- Flow shop scheduling problems with deteriorating jobs under dominating machines
