A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
type: Item
instance of: scholarly article
title: A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
zbMATH Open document ID: 1188.90088
author: Kailiang Xu
author: Keliang Jun
author: Zuren Feng
published in: Computers \& Operations Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5720291
zbMATH Keywords: single machine scheduling
zbMATH Keywords: tabu-search
zbMATH Keywords: convex resource consumption function
MaRDI profile type: Publication
full work available at URL: j.cor.2009.11.012
OpenAlex ID: W2069348829
cites work: Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3741388
cites work: Single machine scheduling problem with a common deadline and resource dependent release dates
cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
cites work: Convex resource allocation for minimizing the makespan in a single machine with job release dates
cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
cites work: Minimizing the total weighted flow time in a single machine with controllable processing times
cites work: Parallel machine scheduling with a convex resource consumption function
cites work: Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
cites work: A survey of scheduling with controllable processing times
cites work: Q4124328
cites work: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
cites work: A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
cites work: Applying tabu search to the job-shop scheduling problem
cites work: A tabu search algorithm for parallel machine total tardiness problem
cites work: A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
DOI: 10.1016/J.COR.2009.11.012
description: scientific article; zbMATH DE number 5720291