A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective

Kuhpfahl, Jens; Bierwirth, Christian

doi:10.1016/j.cor.2015.07.011

Cited by 63 publications

(21 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, these instances do not constitute a commonly used benchmark set so that no optimal solutions or lower bounds are known or presented to evaluate the capability of the method. [17] BJSP Cmax (10,30), (15,20) Greedy Heuristics Meloni et al 2004 [31] BJSP Cmax (10, 10) Rollout Metaheuristic Gröflin and Klinkert 2009 [13] BJSP Cmax (10, 50), (15,20), (20,20) Tabu Search Oddi et al 2012 [32] BJSP Cmax (10,30), (15,15) Iterative Improvement Scheme AitZai and Boudhar 2013 [33] BJSP Cmax (10,30), (15,15) Particle Swarm Optimization Pranzo and Pacciarelli 2016 [34] BJSP Cmax (10,30), (15,20) Iterative Greedy Algorithm Bürgy 2017 [9] BJSP regular (10,30), (15,20), (20,30) Tabu Search Dabah et al 2019 [35] BJSP Cmax (10,30), (15,15) Parallel Tabu Search * Objective Functions: makespan Cmax, total tardiness ∑ T i , total weighted tardiness ∑ w i T i , various regular or tardiness-based objectives.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Promising results are found on a widely used set of benchmark instances. Different neighborhood structures are discussed and analyzed according to their capability of constructing schedules for a JSP with release dates and total weighted tardiness minimization in [30]. The experimental results show that the choice of the main metaheuristic method and the initial solution influence the performance significantly.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems

Lange

Werner

2019

Algorithms

View full text Add to dashboard Cite

The job shop scheduling problem with blocking constraints and total tardiness minimization represents a challenging combinatorial optimization problem of high relevance in production planning and logistics. Since general-purpose solution approaches struggle with finding even feasible solutions, a permutation-based heuristic method is proposed here, and the applicability of basic scheduling-tailored mechanisms is discussed. The problem is tackled by a local search framework, which relies on interchange- and shift-based operators. Redundancy and feasibility issues require advanced transformation and repairing schemes. An analysis of the embedded neighborhoods shows beneficial modes of implementation on the one hand and structural difficulties caused by the blocking constraints on the other hand. The applied simulated annealing algorithm generates good solutions for a wide set of benchmark instances. The computational results especially highlight the capability of the permutation-based method in constructing feasible schedules of valuable quality for instances of critical size and support future research on hybrid solution techniques.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems

Lange

Werner

2019

Algorithms

View full text Add to dashboard Cite

show abstract

“…Operating rooms are considered among the most expensive hospital facilities. Kuhpfahl and Bierwirth (2016) consider the job shop scheduling problem also with total weighted tardiness as objective in order to achieve a high service level. It considers the problem of determining, over a oneweek planning horizon, the allocation of operating rooms time blocks to specialties together with the subsets of patients to be scheduled within each time block.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Sample Average Approximation (SAA) method is used to obtain an optimal schedule for minimizing the regular and overtime assignment costs. Kuhpfahl and Bierwirth (2016) consider the job shop scheduling problem also with total weighted tardiness as objective in order to achieve a high service level. In a situation where not all job due dates can be met, the minimization of the total (weighted) tardiness of the jobs turns out as an appropriate objective for machine scheduling.…”

Section: Literature Reviewmentioning

confidence: 99%

Workforce Scheduling in Administrative Operations: A Case Study in Accounting

Miranda

2018

Can J Adm Sci

View full text Add to dashboard Cite

This paper considers a case study of dynamic job scheduling applied to a real accounting operation. Tasks are assigned to agents over a time horizon minimizing the number of delays and overtime while maximizing the number of anticipated tasks. The solution respects a set of constraints such as agent skills, due time and precedence requirements. It also accounts for uncertainties by capturing changes in the environment such as new orders, changes in the agents' availability and unexpected problems while performing a task. The manager is given a chance to first simulate and then deploy corrective actions to mitigate the impact of changes in the environment. Two heuristics are developed and the results show a significant performance improvement in the operation. RésuméDans le présent article, nous examinons une étude de cas de la planification dynamique des tâches appliquée à une véritable opération comptable. Les tâches sont assignées aux agents sur un horizon temporel qui minimise le nombre de retards et d'heures supplémentaires tout en maximisant le nombre de tâches prévues. La solution respecte un ensemble de contraintes telles que les compétences des agents, le temps nécessaire et les exigences de priorité. Il tient également compte des incertitudes en prenant en compte les changements dans l'environnement tels que les nouvelles commandes, les changements dans la disponibilité des agents et les problèmes inattendus dans l'exécution d'une tâche. Le gestionnaire a la chance de simuler d'abord la tâche et de déployer ensuite des mesures correctives pour atténuer l'impact des changements dans l'environnement. Deux heuristiques sont développées et les résultats montrent une amélioration considérable des performances de l'opération.

show abstract

“…This idea has been successfully exploited for Jm//C max (Van Laarhoven et al, 1992;Nowicki and Smutnicki, 1996;Balas and Vazacopoulos, 1998;Nowicki and Smutnicki, 2005;Peng et al, 2015) and Jm// j w j T j (Kreipl, 2000;De Bontridder, 2005;Essafi et al, 2008;Bülbül, 2011;Kuhpfahl and Bierwirth, 2016) by several authors. The interested reader is referred to Vaessens et al (1996) and Kuhpfahl and Bierwirth (2016) for an overview of the various neighborhood operators applied to Jm//C max and Jm// j w j T j . The work of De Bontridder (2005) must receive a special mention here because similar to our work this author relies on a network flow model of the timing problem for an operation swap-based neighborhood definition embedded into a tabu search algorithm.…”

Section: Introductionmentioning

confidence: 99%

The job shop scheduling problem with convex costs

Bürgy

Bülbül

2018

European Journal of Operational Research

View full text Add to dashboard Cite

The job shop scheduling literature has been dominated by a focus on regular objective functionsin particular the makespan -in its half a century long history. The last twenty years have encountered a spike of interest in other objectives, such as the total weighted tardiness, but research on non-regular objective functions has always been isolated and scattered. Motivated by this observation, we present a tabu search heuristic for a large class of job shop scheduling problems, where the objective is non-regular in general and minimizes a sum of separable convex cost functions attached to the operation start times and the differences between the start times of arbitrary pairs of operations. This problem definition generalizes a number of problems considered earlier in the literature. A particular notion of "critical paths" derived from the so-called timing problem is at the core of the proposed neighborhood definition exploited successfully in a tabu search algorithm. The computational results attest to the promise of our work.

show abstract

A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective

Cited by 63 publications

References 21 publications

On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems

On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems

Workforce Scheduling in Administrative Operations: A Case Study in Accounting

The job shop scheduling problem with convex costs

Contact Info

Product

Resources

About