Due-window assignment scheduling in the proportionate flow shop setting
type: Item
instance of: scholarly article
title: Due-window assignment scheduling in the proportionate flow shop setting
zbMATH Open document ID: 1455.90075
author: N. E. Zubov
published in: Annals of Operations Research
publication date: 2021-01-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7290733
zbMATH Keywords: scheduling
zbMATH Keywords: flow shop
zbMATH Keywords: due-window assignment
zbMATH Keywords: position-dependent weight
MaRDI profile type: Publication
full work available at URL: s10479-020-03653-1
OpenAlex ID: W3033413122
cites work: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
cites work: Minmax due-date assignment with a time window for acceptable lead-times
cites work: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
cites work: A survey on scheduling problems with due windows
cites work: Proportionate flowshop scheduling with position-dependent weights
cites work: A single machine scheduling problem with common due window and controllable processing times
cites work: Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
cites work: A due-window assignment problem with position-dependent processing times
cites work: On equivalence between the proportionate flow shop and single‐machine scheduling problems
cites work: Review of the ordered and proportionate flow shop scheduling research
cites work: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
cites work: Research on permutation flow shop scheduling problems with general position-dependent learning effects
cites work: Flow shop scheduling problem with conflict graphs
cites work: Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
cites work: A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
cites work: Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
cites work: Minimizing makespan in three-machine flow shops with deteriorating jobs
cites work: Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
cites work: Due-window assignment scheduling problems with position-dependent weights on a single machine
cites work: Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
DOI: 10.1007/S10479-020-03653-1
description: scientific article; zbMATH DE number 7290733