Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows

JEC Arroyo, R dos Santos Ottoni… - Electronic Notes in …, 2011 - Elsevier
In this paper, we compare three multi-objective algorithms based on Variable Neighborhood
Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling …

Metaheuristics for a scheduling problem with rejection and tardiness penalties

S Thevenin, N Zufferey, M Widmer - Journal of scheduling, 2015 - Springer
In this paper, we consider a single-machine scheduling problem (P) inspired from
manufacturing instances. A release date, a deadline, and a regular (ie, non-decreasing) cost …

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

G Liu, H Wang, Y Xie - International Transactions in …, 2024 - Wiley Online Library
As the prefabrication construction method plays an increasingly important role in the
construction of cross‐sea bridges, coordinating the schedule between off‐site prefabrication …

A stochastic scheduling approach to minimise the number of risky jobs and total probability of tardiness

G Egilmez, A Arinsoy, GA Süer - International Journal of …, 2018 - inderscienceonline.com
In this paper, single machine stochastic scheduling problem is addressed where jobs have
probabilistic processing times and deterministic due dates. In classical scheduling literature …

Multi-objective Variable Neighborhood Search algorithms for a just-in-time single machine scheduling problem

JEC Arroyo, R dos Santos Ottoni… - … on Intelligent Systems …, 2011 - ieeexplore.ieee.org
In this paper, we analyze the performance of two multi-objective algorithms based on the
Variable Neighborhood Search (VNS). The first algorithm was proposed by Geiger and the …

[PDF][PDF] Sequenciamento em uma Máquina: Otimização Heurística via multiprocessamento paralelo

F Gonçalves, MJF Souza - Belo Horizonte, 2010 - decom.ufop.br
Este trabalho tem seu foco no problema de sequenciamento em uma máquina com
penalidades por antecipação e atraso da produção. São considerados tempos de …

[PDF][PDF] An Overview of the Extended Neighborhood Search Techniques for Shop Scheduling Problems

O Yavas - researchgate.net
The scheduling methods, introduced by the academicians and practitioners, have been
developed day by day. The new branches/subdivisions of the main methods are being …

[PDF][PDF] Multi-Objective Variable Neighborhood Search Algorithms تﺎﯾﻣزراوﺧﻟﻟ راوﺟﻟا ثﺣﺑ تارﯾﻐﺗﻣﻟ ةددﻌﺗﻣ لاود

TS Abdul-Razaq, HAA Mohammed - Journal of Kerbala University, 2016 - iasj.net
Abstract The Multi-Objective Single Machine Scheduling (MOSMS) Problem is one of the
most representative problems in the scheduling area. In this paper, we compare five multi …