Metaheuristics for a scheduling problem with rejection and tardiness penalties

DOI10.1007/s10951-014-0395-8zbMath1310.90056OpenAlexW2070377403MaRDI QIDQ2018941

Simon Thevenin, Nicolas Zufferey, Marino Widmer

Publication date: 26 March 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/332684/files/10951_2014_Article_395.pdf

zbMATH Keywords

schedulingmetaheuristicssetupsorder acceptance

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ An analysis of the non-preemptive mixed-criticality match-up scheduling problem ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Graph multi-coloring for a job scheduling application ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ Parallel-batch scheduling with deterioration and rejection on a single machine ⋮ Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs ⋮ Flowshop scheduling with learning effect and job rejection ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection ⋮ A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime

Uses Software

• Tabu search

Cites Work

• Permutation flow shop scheduling with order acceptance and weighted tardiness
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A unified framework for population-based metaheuristics
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Graph colouring approaches for a satellite range scheduling problem
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• Order acceptance using genetic algorithms
• Single machine scheduling with release dates and rejection
• A framework for the description of evolutionary algorithms
• Multi-neighborhood tabu search for the maximum weight clique problem
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
• Scheduling a single machine to minimize a regular objective function under setup constraints
• Probabilistic diversification and intensification in local search for vehicle routing
• Dominance-based heuristics for one-machine total cost scheduling problems
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling
• Handbook of metaheuristics
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• Adaptive memory programming: a unified view of metaheuristics

This page was built for publication: Metaheuristics for a scheduling problem with rejection and tardiness penalties