A note on single-machine scheduling with decreasing time-dependent job processing times
type: Item
instance of: scholarly article
title: A note on single-machine scheduling with decreasing time-dependent job processing times
zbMATH Open document ID: 1185.90098
author: B. E. Eshmatov
published in: Applied Mathematical Modelling
publication date: 2010-05-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5703187
zbMATH Keywords: scheduling
zbMATH Keywords: single-machine
zbMATH Keywords: time-dependent processing times
zbMATH Keywords: resource allocation
MaRDI profile type: Publication
full work available at URL: j.apm.2009.04.018
OpenAlex ID: W2152674480
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Scheduling jobs under decreasing linear deterioration
cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines
cites work: Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
cites work: Minimizing total completion time in a two-machine flow shop with deteriorating jobs
cites work: Scheduling in a contaminated area: a model and polynomial algorithms
cites work: Flow shop scheduling problems with decreasing linear deterioration under dominant machines
cites work: Scheduling deteriorating jobs subject to job or machine availability constraints
cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
cites work: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
cites work: Multi-machine scheduling with deteriorating jobs and scheduled maintenance
cites work: Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
cites work: Complexity of scheduling tasks with time-dependent execution times
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
cites work: Single machine scheduling to minimize weighted earliness subject to no tardy jobs
cites work: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
cites work: Scheduling start time dependent jobs to minimize the total weighted completion time
cites work: Q4789850
cites work: Single machine scheduling problems with deteriorating jobs
cites work: Time-optimal control in a single machine problem with resource constraints
cites work: Resource optimal control in some single-machine scheduling problems
DOI: 10.1016/J.APM.2009.04.018
description: scientific article; zbMATH DE number 5703187