A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
From MaRDI portal
Publication:2438422
DOI10.3934/jimo.2014.10.1071zbMath1292.90330arXiv1301.7134MaRDI QIDQ2438422
Yi Wang, Peng Guo, Wenming Cheng
Publication date: 11 March 2014
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.7134
single-machine scheduling; heuristic; step-deterioration; total tardiness; general variable neighborhood search
90C11: Mixed integer programming
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time, Nested general variable neighborhood search for the periodic maintenance problem, Modeling the parallel machine scheduling problem with step deteriorating jobs, A two-agent single-machine scheduling problem with late work criteria, Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties, Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
Uses Software
Cites Work
- New heuristics for solving the economic lot scheduling problem with reworks
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
- Parallel-machine scheduling of simple linear deteriorating jobs
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- The single-machine total tardiness scheduling problem: review and extensions
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Variable neighborhood search
- A concise survey of scheduling with time-dependent processing times
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Variable neighborhood decomposition search
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Batch scheduling with step-deteriorating processing times to minimize flowtime
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling Deteriorating Jobs on a Single Processor
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Scheduling deteriorating jobs to minimize makespan
- Scheduling jobs with piecewise linear decreasing processing times
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Scheduling
- Minimizing maximum lateness under linear deterioration
- Single machine scheduling with step-deteriorating processing times
