A meta-heuristic to solve the just-in-time job-shop scheduling problem

DOI10.1016/J.EJOR.2020.04.017MaRDI QIDQ2028835zbMATH OpenOpenAlexFDO

Authors Mohammad Mahdi Ahmadian, Amir Salehipour, T. C. Edwin Cheng

Publication date 3 June 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2020.04.017

zbMATH Keywords

heuristicjust-in-timerelax-and-solverelaxation neighbourhoodschedulingweighted earliness-tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem
• Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
• A recovering beam search algorithm for the single machine just-in-time scheduling problem

Cites work

• A hybrid approach to scheduling with earliness and tardiness costs
• Algorithms for Solving Production-Scheduling Problems
• An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
• Dynamic scheduling of aircraft landings
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• Lagrangian bounds for just-in-time job-shop scheduling
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
• Part logistics in the automotive industry: decision problems, literature review and research agenda
• Proactive release procedures for just-in-time job shop environments, subject to machine failures
• Real time management of a metro rail terminus
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Surgical case scheduling as a generalized job shop scheduling problem
• Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
• The Complexity of Flowshop and Jobshop Scheduling
• The job shop scheduling problem with convex costs
• Variable neighborhood search
• Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem

Cited in

(11)

• A study on the enhanced best performance algorithm for the just-in-time scheduling problem
• Shop scheduling in manufacturing environments: a review
• Novel model and solution method for flexible job shop scheduling problem with batch processing machines
• Heuristics for flights arrival scheduling at airports
• The coupled task scheduling problem: an improved mathematical program and a new solution algorithm
• INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
• A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times
• An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
• A rollout metaheuristic for job shop scheduling problems
• A knowledge-based matheuristic driven by dueling Q-learning for integrated task planning and lot-streaming scheduling in cloud manufacturing
• A dual-population memetic algorithm for job shop scheduling problem considering sorting flexibility

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A meta-heuristic to solve the just-in-time job-shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028835)