A tabu method for a two-agent single-machine scheduling with deterioration jobs
From MaRDI portal
(Redirected from Publication:336450)
Recommendations
- A single-machine scheduling problem with two-agent and deteriorating jobs
- An optimal scheduling algorithm on single-machine with two-agent and deteriorating jobs
- Single machine two-agent scheduling with deteriorating jobs
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- A two-agent scheduling problem with deterioration
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- A concise survey of scheduling with time-dependent processing times
- A dual algorithm for the one-machine scheduling problem
- A multiple-criterion model for machine scheduling
- A note on single-processor scheduling with time-dependent execution times
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A note on the scheduling with two families of jobs
- A single-machine scheduling problem with two-agent and deteriorating jobs
- A single-machine two-agent scheduling problem by GA approach
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- 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
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling Problems with Two Competing Agents
- Scheduling problems with learning and ageing effects: a survey
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Scheduling with time dependent processing times: Review and extensions
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Solving a two-agent single-machine scheduling problem considering learning effect
- Tabu Search—Part I
- Tabu search for total tardiness minimization in flowshop scheduling problems
- The two-machine total completion time flow shop problem
- Time-dependent scheduling
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Two-agent single-machine scheduling with assignable due dates
Cited in
(8)- A mathematical programming-based scheduling framework for multitasking environments
- Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria
This page was built for publication: A tabu method for a two-agent single-machine scheduling with deterioration jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336450)
