Parallel-machine scheduling with time-dependent and machine availability constraints
type: Item
instance of: scholarly article
title: Parallel-machine scheduling with time-dependent and machine availability constraints
zbMATH Open document ID: 1394.90294
DOI: 10.1155/2015/956158
author: Cuixia Miao
author: Juan Zou
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: We consider the parallel-machine scheduling problem in which the machines have availability constraints and the processing time of each job is simple linear increasing function of its starting times. For the makespan minimization problem, which is NP-hard in the strong sense, we discuss the Longest Deteriorating Rate algorithm and List Scheduling algorithm; we also provide a lower bound of any optimal schedule. For the total completion time minimization problem, we analyze the strong NP-hardness, and we present a dynamic programming algorithm and a fully polynomial time approximation scheme for the two-machine problem. Furthermore, we extended the dynamic programming algorithm to the total weighted completion time minimization problem.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6927682
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/956158
OpenAlex ID: W1891127169
Wikidata QID: Q59120038
cites work: Time-dependent scheduling
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Q4934199
cites work: Machine scheduling with an availability constraint
cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
cites work: Scheduling linear deteriorating jobs with an availability constraint on a single machine
cites work: Complexity and approximability of scheduling resumable proportionally deteriorating jobs
cites work: Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
cites work: Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
cites work: Parallel-machine scheduling of simple linear deteriorating jobs
cites work: Approximation algorithms for parallel machine scheduling with linear deterioration
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
description: scientific article; zbMATH DE number 6927682