Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
type: Item
instance of: scholarly article
title: Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
zbMATH Open document ID: 0947.90046
DOI: 10.1016/S0166-218X(99)00165-1
author: Svetlana A. Kravchenko
published in: Discrete Applied Mathematics
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1395032
zbMATH Keywords: job-shop
zbMATH Keywords: \(NP\)-hard problem
zbMATH Keywords: pseudo-polynomial algorithm
MaRDI profile type: Publication
cites work: Q3942735
cites work: Minimizing maximum lateness in a two-machine unit-time job shop
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
cites work: Reducibility among Combinatorial Problems
cites work: An efficient algorithm for a job shop problem
cites work: Total completion time minimization in two-machine job shops with unit-time operations
cites work: Q3995531
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Q3737196
cites work: A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
cites work: Is a unit-job shop not easier than identical parallel machines?
Wikidata QID: Q127172193
Recommended article: Two-machine flowshop scheduling to minimize the number of tardy jobs
Recommended article: Two-machine flow-shop scheduling to minimize total late work: revisited
Recommended article: Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
Recommended article: Minimizing late jobs in the general one machine scheduling problem
Recommended article: Minimizing the number of tardy jobs in two-machine settings with common due date
Recommended article: Minimising Maximum Lateness in a Two-Machine Flowshop
Recommended article: Single machine scheduling with two job classes : minimizing maximum lateness
Recommended article: Two-machine flowshop scheduling to minimize total tardiness
Recommended article: On the complexity of minimizing the number of late jobs in unit time open shop
Recommended article: An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system
description: scientific article; zbMATH DE number 1395032