Scheduling on parallel identical machines with late work criterion: offline and online cases
type: Item
instance of: scholarly article
title: Scheduling on parallel identical machines with late work criterion: offline and online cases
zbMATH Open document ID: 1386.90050
author: Xin Chen
author: Xin Han
author: Małgorzata Sterna
author: Jacek Blazewicz
published in: Journal of Scheduling
publication date: 2018-02-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6845406
zbMATH Keywords: online and offline scheduling
zbMATH Keywords: identical parallel machines
zbMATH Keywords: late work
zbMATH Keywords: NP-hardness
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s10951-015-0464-7
OpenAlex ID: W2220526905
Wikidata QID: Q57387695
cites work: Q3680271
cites work: Internet shopping with price sensitive discounts
cites work: Minimizing mean weighted execution time loss on identical and uniform processors
cites work: The two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Q2712360
cites work: Open shop scheduling problems with late work criteria.
cites work: KI 2005: Advances in Artificial Intelligence
cites work: A note on the two machine job shop with the weighted late work criterion
cites work: Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Q4223058
cites work: Optimal algorithms for online scheduling with bounded rearrangement at the end
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: The Power of Reordering for Online Minimum Makespan Scheduling
cites work: Online algorithms. The state of the art
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Single Machine Scheduling to Minimize Total Weighted Late Work
cites work: Minimizing the number of tardy job units under release time constraints
cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
cites work: Online Minimum Makespan Scheduling with a Buffer
cites work: Q5462244
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
cites work: Dominance relations for two-machine flow shop problem with late work criterion
cites work: Online scheduling with reassignment
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
DOI: 10.1007/S10951-015-0464-7
Recommended article: Scheduling on parallel identical machines to minimize total tardiness
Recommended article: Online Scheduling with Hard Deadlines on Parallel Machines
Recommended article: On-line scheduling with rejection on identical parallel machines
Recommended article: Online scheduling of two type parallel jobs on identical machines
Recommended article: Online scheduling on parallel machines: A survey
Recommended article: Online Scheduling of Equal-Length Jobs on Parallel Machines
Recommended article: On-line scheduling of parallel machines to minimize total completion times
Recommended article: Online scheduling of parallel jobs with preemption on two identical machines
Recommended article: Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
Recommended article: Q4709623
description: scientific article; zbMATH DE number 6845406