Single-machine scheduling with nonlinear deterioration
From MaRDI portal
Publication:691413
DOI10.1007/s11590-010-0253-3zbMath1259.90040OpenAlexW1996348797MaRDI QIDQ691413
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0253-3
Related Items
Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times, Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan, A note on ``Single-machine scheduling problems with both deteriorating jobs and learning effects, Single-machine scheduling problems with an actual time-dependent deterioration, Single-machine scheduling with logarithm deterioration, Scheduling jobs with truncated exponential learning functions, Optimization of scheduling problems with deterioration effects and an optional maintenance activity, Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs, Optimal due-date assignment problem with learning effect and resource-dependent processing times, Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time, Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time, Single-machine scheduling with accelerating deterioration effects, Single-machine group scheduling with deteriorating jobs and allotted resource, Scheduling two agents with sum-of-processing-times-based deterioration on a single machine, Single-machine ready times scheduling with group technology and proportional linear deterioration, A note on single-machine scheduling with nonlinear deterioration, Minimizing makespan in a two-machine flow shop with effects of deterioration and learning, Machine scheduling problems with a position-dependent deterioration, Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times, Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, SCHEDULING POSITION-BASED DETERIORATING JOBS WITH MULTIPLE RATE-MODIFYING ACTIVITIES AND PAST-SEQUENCE-DEPENDENT DELIVERY TIMES
Cites Work
- Unnamed Item
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Time-dependent scheduling
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- A concise survey of scheduling with time-dependent processing times
- Single-machine group scheduling problems with deterioration consideration
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- Heuristic for a new multiobjective scheduling problem
- Parallel-machine scheduling under potential disruption
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Single-machine scheduling problems with start-time dependent processing time
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- Scheduling with time dependent processing times: Review and extensions
- Minimizing Variation of Flow Time in Single Machine Systems
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with piecewise linear decreasing processing times
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
