NP-hardness of shop-scheduling problems with three jobs
type: Item
instance of: scholarly article
title: NP-hardness of shop-scheduling problems with three jobs
zbMATH Open document ID: 0837.90072
DOI: 10.1016/0166-218X(93)E0169-Y
published in: Discrete Applied Mathematics
publication date: 1996-05-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 769295
zbMATH Keywords: optimal makespan
zbMATH Keywords: job-shop
zbMATH Keywords: open-shop
zbMATH Keywords: maximum completion time
zbMATH Keywords: mean flow time
zbMATH Keywords: complexity of shop-scheduling
zbMATH Keywords: NP-hardness proof
author: Yuri N. Sotskov
author: N. V. Shakhlevich
MaRDI profile type: Publication
cites work: Scheduling the Open Shop to Minimize Mean Flow Time
cites work: An efficient algorithm for the job-shop problem with two jobs
cites work: A Geometric Model and a Graphical Algorithm for a Sequencing Problem
cites work: Q4658190
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Q4124328
cites work: Q4194705
cites work: On general routing problems
cites work: Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
cites work: Q3824093
cites work: The complexity of shop-scheduling problems with two or three jobs
cites work: Q3483071
cites work: Q3751360
cites work: Q4841579
cites work: Solution of the Akers-Friedman Scheduling Problem
description: scientific article; zbMATH DE number 769295