Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
type: Item
instance of: scholarly article
title: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
zbMATH Open document ID: 1157.90412
author: Márton Drótos
author: Gábor Erdős
author: Tamás Kis
published in: European Journal of Operational Research
publication date: 2009-04-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 5541455
zbMATH Keywords: scheduling
zbMATH Keywords: batching
zbMATH Keywords: tabu search
zbMATH Keywords: mathematical programming
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.06.004
OpenAlex ID: W2005510197
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Minimizing the makespan for the flow shop scheduling problem with availability constraints.
cites work: Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
cites work: Routing and scheduling in a flexible job shop by tabu search
cites work: Q3425131
cites work: Tabu-search for the multi-mode job-shop problem
cites work: Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling
cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
cites work: Minimizing total weighted tardiness in a generalized job shop
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: A user's guide to tabu search
cites work: Job-shop scheduling with processing alternatives.
cites work: A large step random walk for minimizing total weighted tardiness in a job shop
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: New single machine and job-shop scheduling problems with availability constraints
cites work: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: The flow shop with parallel machines: A tabu search approach
cites work: Q4238569
cites work: Scheduling with batching: A review
cites work: Scheduling with limited machine availability
cites work: Practical job shop scheduling
cites work: An overview of heuristic solution methods
cites work: Decomposition methods for large job shops
cites work: On the application of insertion techniques for job shop problems with setup times
cites work: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
cites work: A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
DOI: 10.1016/J.EJOR.2008.06.004
description: scientific article; zbMATH DE number 5541455