Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
type: Item
instance of: scholarly article
title: Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
zbMATH Open document ID: 0967.90044
DOI: 10.1016/S0377-2217(99)00253-2
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: 1471177
zbMATH Keywords: approximation algorithm
zbMATH Keywords: worst-case analysis
author: Inna G. Drobouchevitch
author: V. A. Strusevich
MaRDI profile type: Publication
cites work: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
cites work: A New Heuristic for Three-Machine Flow Shop Scheduling
cites work: Heuristics for short route job shop scheduling problems
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: A flowshop scheduling problem with two operations per job
cites work: Approximability of flow shop scheduling
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Q3995531
cites work: Minimizing makespan in hybrid flowshops
cites work: Two-stage flowshop scheduling with a common second-stage machine
cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
cites work: On some geometric methods in scheduling theory: A survey
cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
cites work: Short Shop Schedules
full work available at URL: s0377-2217(99)00253-2
OpenAlex ID: W2054432571
Recommended article: Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
Recommended article: Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
Recommended article: Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
Recommended article: Two-stage open shop scheduling with a bottleneck machine
Recommended article: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
Recommended article: Heuristics for the two‐machine scheduling problem with a single server
Recommended article: Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
Recommended article: An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
Recommended article: A heuristic algorithm for two-machine re-entrant shop scheduling
Recommended article: Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
description: scientific article; zbMATH DE number 1471177