• Home
  • Search
  • Variable neighbourhood search for job scheduling with position-dependent deteriorating processing times
  • Cite Icon10
  • https://doi.org/10.1080/01605682.2022.2064781Copy DOI Icon

Variable neighbourhood search for job scheduling with position-dependent deteriorating processing times

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This article studies the problem of job scheduling in hand-intensive manufacturing with processing times that deteriorate depending on the sequence in order to minimize the maximum delay of the set of jobs. In the literature, only a small number of academic works has considered the assumption of non-stationary workers during the planning horizon. This problem is NP-hard since it is as an extension of the parallel machine scheduling problem with makespan minimization, which is itself NP-hard. A variable neighbourhood search (VNS) algorithm is presented to solve this problem; its efficiency is evaluated through an extended set of numerical experiments with random-generated datasets. Results are compared with an exact method based on mathematical programming. The results show that the VNS algorithm provides good solutions in reasonable computing times even for large problems.

Similar Papers
  • Conference Article
  • Citations1

Study of the General Variable Neighborhood Search (GVNS) algorithm and Variable Neighborhood Search (VNS) algorithm in CVRPTW

  • Jan 01, 2022
  • AIP conference proceedings
  • Ulil Ilmi Fadila +2
  • Research Article
  • Citations136

A hybrid Particle Swarm Optimization – Variable Neighborhood Search algorithm for Constrained Shortest Path problems

  • Mar 16, 2017
  • European Journal of Operational Research
  • Yannis Marinakis +2
  • Research Article
  • Citations2

Green scheduling of packaging in the global logistics distribution centre with a dominant job and deterioration effects

  • Oct 19, 2022
  • International Journal of Logistics Research and Applications
  • Ting Zhao +4
  • Research Article
  • Citations1

A Variable Neighborhood Search Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem

  • Apr 29, 2025
  • Sustainability
  • Xiafei Xie +2
  • Research Article
  • Citations41

A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times

  • Feb 15, 2020
  • European Journal of Operational Research
  • Gonzalo Mejía +1
  • Research Article
  • Citations1

Solving a discrete congested multi-objective location problem by hybrid simulated annealing with customer’s perspective

  • Oct 01, 2016
  • Scientia Iranica
  • Maryam Ghobadi +3
  • Research Article

Solving fuzzy fractional programming problems by VNS algorithm using modified Kerre's inequality

  • Dec 16, 2024
  • Edelweiss Applied Science and Technology
  • Dhurgam Kalel Ibrahim Alsaad +3
  • Research Article

E-Commerce Delivery Optimization with Bicycle Deliveryman and Dual Autonomous Robots

  • Aug 07, 2024
  • Advances in Information Management and Economic Development Research
  • Wenxuan Kang +3
  • Research Article
  • Citations8

A variable neighborhood search algorithm for an integrated physician planning and scheduling problem

  • Jul 26, 2022
  • Computers & Operations Research
  • Shaowen Lan +3
  • Research Article
  • Citations29

The classroom assignment problem: Complexity, size reduction and heuristics

  • Oct 25, 2013
  • Applied Soft Computing
  • Abdelkarim Elloumi +3
  • Research Article
  • Citations64

Mathematical Modeling and Optimization of Energy-Conscious Flexible Job Shop Scheduling Problem With Worker Flexibility

  • Jan 01, 2019
  • IEEE Access
  • Leilei Meng +3
  • Research Article
  • Citations44

A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources

  • Jan 04, 2011
  • International Journal of Production Research
  • Hadi Mokhtari +2
  • Conference Article
  • Citations4

A modified variable neighborhood search algorithm for orienteering problems

  • Jul 01, 2010
  • Min-Hua Lo +2
  • Research Article
  • Citations112

A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system

  • Oct 13, 2010
  • Information Sciences
  • Yun Wen +2
  • Research Article
  • Citations20

Variable Neighborhood Search for Multi-Cycle Medical Waste Recycling Vehicle Routing Problem with Time Windows

  • Oct 08, 2022
  • International Journal of Environmental Research and Public Health
  • Wanting Zhang +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.