A single-machine scheduling with a truncated linear deterioration and ready times
type: Item
instance of: scholarly article
title: A single-machine scheduling with a truncated linear deterioration and ready times
zbMATH Open document ID: 1321.90060
author: Chin-Chia Wu
author: Wen-Hsiang Wu
author: Wen-Hung Wu
author: Peng-Hsiang Hsu
author: Yunqiang Yin
author: Jianyou Xu
published in: Information Sciences
publication date: 2015-09-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6485504
zbMATH Keywords: scheduling
zbMATH Keywords: single-machine
zbMATH Keywords: deteriorating job
zbMATH Keywords: ant colony
zbMATH Keywords: tabu search
MaRDI profile type: Publication
full work available at URL: j.ins.2013.08.030
OpenAlex ID: W2033161932
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: Scheduling start time dependent jobs to minimize the total weighted completion time
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: A note on single-processor scheduling with time-dependent execution times
cites work: Q4017560
cites work: A concise survey of scheduling with time-dependent processing times
cites work: The complexity of scheduling starting time dependent tasks with release times
cites work: Single machine scheduling with step-deteriorating processing times
cites work: Scheduling jobs with piecewise linear decreasing processing times
cites work: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
cites work: Q5480099
cites work: Time-dependent scheduling
cites work: Tabu Search—Part I
cites work: Single machine sequencing with linear models of release dates
cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
cites work: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
cites work: Single machine scheduling with start time dependent processing times: Some solvable cases
cites work: Minimizing total completion time in a two-machine flow shop with deteriorating jobs
cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines
cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
cites work: Single machine group scheduling under decreasing linear deterioration
DOI: 10.1016/J.INS.2013.08.030
description: scientific article; zbMATH DE number 6485504