A batch-oblivious approach for complex job-shop scheduling problems
type: Item
instance of: scholarly article
title: A batch-oblivious approach for complex job-shop scheduling problems
zbMATH Open document ID: 1380.90119
author: Sebastian Knopp
author: Stèphane Dauzère-Pérès
author: Claude Yugma
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6835204
zbMATH Keywords: scheduling
zbMATH Keywords: flexible job-shop scheduling with batching
zbMATH Keywords: grasp
zbMATH Keywords: metaheuristics
zbMATH Keywords: OR in semiconductor manufacturing
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.04.050
OpenAlex ID: W2609642187
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
cites work: Q3425131
cites work: A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
cites work: Q4658190
cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
cites work: Greedy randomized adaptive search procedures
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Tabu search for the job-shop scheduling problem with multi-purpose machines
cites work: Q4882527
cites work: Topological sorting of large networks
cites work: Maintaining longest paths incrementally
cites work: Heuristics for minimizing total weighted tardiness in complex job shops
cites work: Effective neighbourhood functions for the flexible job shop problem
cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem
cites work: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
cites work: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
cites work: Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
cites work: A dynamic topological sort algorithm for directed acyclic graphs
cites work: Scheduling with batching: A review
cites work: Heuristic approaches for scheduling jobs in large-scale flexible job shops
cites work: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
DOI: 10.1016/J.EJOR.2017.04.050
description: scientific article; zbMATH DE number 6835204