Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
type: Item
instance of: scholarly article
title: Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
zbMATH Open document ID: 0835.90114
DOI: 10.1016/0166-218X(93)E0153-P
author: V. A. Strusevich
published in: Discrete Applied Mathematics
publication date: 1995-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 756146
zbMATH Keywords: two machine flow shop scheduling
MaRDI profile type: Publication
cites work: Recognition of Gilmore-Gomory traveling salesman problem
cites work: Q5541037
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Q3768703
cites work: Optimal flowshop schedules with no intermediate storage space
cites work: Two machine mixed shop scheduling problem with controllable machine speeds
cites work: TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
cites work: Q4124328
cites work: Flowshop scheduling with limited temporary storage
cites work: On the Flow-Shop Sequencing Problem with No Wait in Process†
cites work: The Three-Machine No-Wait Flow Shop is NP-Complete
cites work: Complexity of Scheduling Shops with No Wait in Process
cites work: A note on the flow-shop problem without interruptions in job processing
cites work: An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
cites work: On the derivation of the Pauli and van Hove master equations.
cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
full work available at URL: 0166-218x(93)e0153-p
OpenAlex ID: W2091541858
description: scientific article; zbMATH DE number 756146