Complexity analysis of job-shop scheduling with deteriorating jobs
type: Item
instance of: scholarly article
title: Complexity analysis of job-shop scheduling with deteriorating jobs
zbMATH Open document ID: 1004.68031
DOI: 10.1016/S0166-218X(00)00385-1
author: Gur Mosheiov
published in: Discrete Applied Mathematics
publication date: 2002-05-15T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1742057
zbMATH Keywords: deterministic scheduling
zbMATH Keywords: makespan minimization
zbMATH Keywords: job-shop
MaRDI profile type: Publication
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: Parallel machine scheduling with time dependent processing times
cites work: Q4198056
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: The NP-completeness column: An ongoing guide
cites work: Scheduling deteriorating jobs to minimize makespan
cites work: Computational Complexity of Discrete Optimization Problems
cites work: V-Shaped Policies for Scheduling Deteriorating Jobs
cites work: Scheduling jobs under simple linear deterioration
cites work: Multi-Machine Scheduling With Linear Deterioration
cites work: Single machine scheduling with start time dependent processing times: Some solvable cases
full work available at URL: s0166-218x(00)00385-1
OpenAlex ID: W2053443627
description: scientific article; zbMATH DE number 1742057