Single-machine online scheduling of jobs with non-delayed processing constraint
type: Item
instance of: scholarly article
title: Single-machine online scheduling of jobs with non-delayed processing constraint
zbMATH Open document ID: 1473.90069
author: Jinjiang Yuan
author: Wenjie Li
published in: Journal of Combinatorial Optimization
publication date: 2021-08-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7380944
zbMATH Keywords: online scheduling
zbMATH Keywords: weighted completion time
zbMATH Keywords: delivery time
zbMATH Keywords: non-delayed processing
MaRDI profile type: Publication
full work available at URL: s10878-021-00722-4
OpenAlex ID: W3137929948
cites work: Restarts can help in the on-line minimization of the maximum delivery time on a single machine
cites work: A survey of scheduling problems with no-wait in process
cites work: Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time
cites work: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
cites work: Optimal on-line algorithms for one batch machine with grouped processing times
cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
cites work: On no-wait and no-idle flow shops with makespan criterion
cites work: Q2948897
cites work: Online scheduling on bounded batch machines to minimize the maximum weighted completion time
cites work: An optimal online algorithm for single machine scheduling with bounded delivery times
cites work: Single machine scheduling with two competing agents and equal job processing times
cites work: Q4821818
cites work: Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
cites work: On-line scheduling with delivery time on a single batch machine
cites work: A best on-line algorithm for single machine scheduling with small delivery times
cites work: An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
cites work: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
cites work: Online over time scheduling on parallel-batch machines: a survey
cites work: Q4223483
cites work: Scheduling with release dates and preemption to minimize multiple max-form objective functions
cites work: A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
cites work: Bicriteria scheduling of equal length jobs on uniform parallel machines
DOI: 10.1007/S10878-021-00722-4
Recommended article: Q4835595
Recommended article: Q3195995
Recommended article: Optimal on-line algorithms for single-machine scheduling
Recommended article: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
Recommended article: Online scheduling on a single machine with linear deteriorating processing times and delivery times
Recommended article: Optimal algorithms for online single machine scheduling with deteriorating jobs
Recommended article: An optimal online algorithm for single machine scheduling with bounded delivery times
Recommended article: On-line scheduling on a single machine: Maximizing the number of early jobs
Recommended article: On-line scheduling on a single machine: Minimizing the total completion time
Recommended article: Online scheduling on a single machine with grouped processing times
description: scientific article; zbMATH DE number 7380944