A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints

DOI10.1016/j.ejor.2016.07.030zbMath1394.90312OpenAlexW2491052542MaRDI QIDQ1752766

Gongfa Li, Hegen Xiong, Guozhang Jiang, Huali Fan

Publication date: 24 May 2018

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

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

zbMATH Keywords

dispatching rulesdue date tightnessdynamic job shop scheduling problemextended technical precedence constraintsimulation scheduling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context ⋮ Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints ⋮ A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem ⋮ Shop scheduling in manufacturing environments: a review ⋮ Scheduling wagons to unload in bulk cargo ports with uncertain processing times ⋮ A DRL based approach for adaptive scheduling of one-of-a-kind production

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
• Tabu search algorithms for job-shop problems with a single transport robot
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
• A survey of priority rule-based scheduling
• Extending the shifting bottleneck procedure to real-life applications
• The job shop scheduling problem: Conventional and new solution techniques
• Scheduling a batching machine
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Scheduling job shops with batch machines using the Lagrangian relaxation technique
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• A comparative study of dispatching rules in dynamic flowshops and jobshops
• Minimizing makespan with release times on identical parallel batching machines
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
• Development and analysis of cost-based dispatching rules for job shop scheduling
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• Complexity of mixed shop scheduling problems: A survey
• Modeling job shop scheduling with batches and setup times by timed Petri nets
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• A survey of scheduling problems with setup times or costs
• Open-shop batch scheduling with identical jobs
• Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules
• A Survey of Scheduling Rules
• The Complexity of Flowshop and Jobshop Scheduling
• An analysis of heuristics in a dynamic job shop with weighted tardiness objectives

This page was built for publication: A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints