Single machine scheduling with a generalized job-dependent cumulative effect
type: Item
instance of: scholarly article
title: Single machine scheduling with a generalized job-dependent cumulative effect
zbMATH Open document ID: 1386.90063
author: Kabir Rustogi
author: V. A. Strusevich
published in: Journal of Scheduling
publication date: 2018-02-28T00:00:00Z
full work available at URL: 20040 STRUSEVICH Single Machine Scheduling 2016.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6845348
zbMATH Keywords: single machine
zbMATH Keywords: deterioration
zbMATH Keywords: precedence constraints
zbMATH Keywords: maintenance
zbMATH Keywords: approximation scheme
zbMATH Keywords: half-product problem
MaRDI profile type: Publication
OpenAlex ID: W2523620715
cites work: Multiagent Scheduling
cites work: Minimization of half-products
cites work: Single machine scheduling with precedence constraints and positionally dependent processing times
cites work: FPTAS for half-products minimization with scheduling applications
cites work: Time-dependent scheduling
cites work: Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
cites work: Machine scheduling problems with a position-dependent deterioration
cites work: Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
cites work: MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
cites work: The symmetric quadratic knapsack problem: approximation and scheduling applications
cites work: Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
cites work: Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
cites work: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Machine scheduling with a rate-modifying activity
cites work: Sequencing with Series-Parallel Precedence Constraints
cites work: Simple matching vs linear assignment in scheduling models with positional effects: a critical review
cites work: A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
cites work: Q4323632
cites work: The Recognition of Series Parallel Digraphs
cites work: Scheduling jobs under decreasing linear deterioration
cites work: Some scheduling problems with general position-dependent and time-dependent learning effects
DOI: 10.1007/S10951-016-0497-6
description: scientific article; zbMATH DE number 6845348