Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
type: Item
instance of: scholarly article
title: Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
zbMATH Open document ID: 1464.90028
author: Gur Mosheiov
author: Assaf Sarig
author: V. A. Strusevich
published in: 4OR
publication date: 2021-05-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7350170
zbMATH Keywords: scheduling
zbMATH Keywords: sequencing
zbMATH Keywords: due-window assignment
zbMATH Keywords: position-dependent processing times
zbMATH Keywords: proportionate flow shop
zbMATH Keywords: job-rejection
MaRDI profile type: Publication
full work available at URL: s10288-019-00418-w
OpenAlex ID: W2971245531
cites work: Single-machine scheduling with learning considerations
cites work: Scheduling with rejection and non-identical job arrivals
cites work: Theory and Applications of Models of Computation
cites work: Scheduling linear deteriorating jobs with rejection on a single machine
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Algorithms for two bottleneck optimization problems
cites work: A note on scheduling on a single processor with speed dependent on a number of executed jobs
cites work: Improved algorithms for single machine scheduling with release dates and rejections
cites work: Soft due window assignment and scheduling of unit-time jobs on parallel machines
cites work: A survey on scheduling problems with due windows
cites work: An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
cites work: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
cites work: Bounded single-machine parallel-batch scheduling with release dates and rejection
cites work: A common due-data assignment problem on parallel identical machines
cites work: A Due-Window Determination In Minmax Scheduling Problems
cites work: Proportionate flowshops with general position-dependent processing times
cites work: Minmax scheduling problems with a common due-window
cites work: Scheduling with a common due-window: polynomially solvable cases
cites work: An improved heuristic for parallel machine scheduling with rejection
cites work: Q3212909
cites work: Review of the ordered and proportionate flow shop scheduling research
cites work: Algorithms and Data Structures
cites work: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
cites work: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
cites work: A survey on offline scheduling with rejection
cites work: Some scheduling problems with general position-dependent and time-dependent learning effects
cites work: Parallel-machine scheduling with release dates and rejection
cites work: Single machine scheduling with release dates and rejection
cites work: Single-machine scheduling under the job rejection constraint
DOI: 10.1007/S10288-019-00418-W
description: scientific article; zbMATH DE number 7350170