Minimizing total late work on a single machine with generalized due-dates
type: Item
instance of: scholarly article
title: Minimizing total late work on a single machine with generalized due-dates
zbMATH Open document ID: 1487.90309
author: Gur Mosheiov
author: Daniel Oron
author: Dvir Shabtay
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7355895
zbMATH Keywords: scheduling
zbMATH Keywords: single machine
zbMATH Keywords: total late work
zbMATH Keywords: generalized due-dates
zbMATH Keywords: job rejection
zbMATH Keywords: unavailability period
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.12.061
OpenAlex ID: W3119307998
cites work: A single machine scheduling problem to minimize total early work
cites work: Q3680271
cites work: The two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Single‐machine scheduling with deadlines to minimize the total weighted late work
cites work: Two-machine flow-shop scheduling to minimize total late work: revisited
cites work: A new class of scheduling criteria and their optimization
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
cites work: On the complexity of generalized due date scheduling problems
cites work: Single Machine Scheduling to Minimize Total Weighted Late Work
cites work: On the parameterized tractability of single machine scheduling with rejection
cites work: Single-machine batch scheduling problem with job rejection and resource dependent processing times
cites work: Q2414034
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Machine scheduling with an availability constraint
cites work: A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
cites work: Regular scheduling measures on proportionate flowshop with job rejection
cites work: A note on the SPT heuristic for solving scheduling problems with generalized due dates
cites work: An improved heuristic for parallel machine scheduling with rejection
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: Single machine scheduling with assignable due dates
cites work: THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
cites work: A survey on offline scheduling with rejection
cites work: Q3197606
cites work: Dominance relations for two-machine flow shop problem with late work criterion
cites work: Scheduling with time-changing effects and rate-modifying activities
cites work: Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
cites work: Rescheduling under disruptions in manufacturing systems. Models and algorithms
cites work: Two-agent single-machine scheduling with assignable due dates
cites work: Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
cites work: Single-machine scheduling under the job rejection constraint
cites work: Approximation algorithms for precedence-constrained identical machine scheduling with rejection
DOI: 10.1016/J.EJOR.2020.12.061
description: scientific article; zbMATH DE number 7355895