Efficiency of reductions of job-shop to flow-shop problems
type: Item
instance of: scholarly article
title: Efficiency of reductions of job-shop to flow-shop problems
zbMATH Open document ID: 0967.90046
DOI: 10.1016/S0377-2217(99)00389-6
author: Alain Guinet
published in: European Journal of Operational Research
publication date: 2001-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1515696
zbMATH Keywords: heuristics
zbMATH Keywords: extension Johnson's rule
zbMATH Keywords: scheduling
zbMATH Keywords: job-shop environment
zbMATH Keywords: flow-shop
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: The one-machine sequencing problem
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Reduction of job-shop problems to flow-shop problems with precedence constraints
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A Survey of Scheduling Rules
cites work: Q3525910
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
cites work: Sequency on two and three machines with setup, processing and removal times separated
cites work: Job Shop Scheduling by Simulated Annealing
description: scientific article; zbMATH DE number 1515696