Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
type: Item
instance of: scholarly article
title: Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
zbMATH Open document ID: 1443.90195
author: Zhiwu Li
author: Du-Juan Wang
published in: Information Sciences
publication date: 2020-10-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7256966
zbMATH Keywords: scheduling
zbMATH Keywords: common due-window assignment
zbMATH Keywords: resource-dependent processing times
zbMATH Keywords: Pareto-optimal point
MaRDI profile type: Publication
full work available at URL: j.ins.2018.11.023
OpenAlex ID: W2901569433
cites work: Two-machine open shop problem with controllable processing times
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimization of the makespan in a two-machine problem under given resource constraints
cites work: Resource Management in Machine Scheduling Problems: A Survey
cites work: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
cites work: Soft due window assignment and scheduling of unit-time jobs on parallel machines
cites work: Determination of common due window location in a single machine scheduling problem
cites work: Common due window size and location determination in a single machine scheduling problem
cites work: Scheduling identical jobs and due-window on uniform machines
cites work: Group scheduling with controllable setup and processing times: minimizing total weighted completion time
cites work: Algorithms for Scheduling Independent Tasks
cites work: A survey of scheduling with controllable processing times
cites work: Single machine batch scheduling to minimize total completion time and resource consumption costs
cites work: A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
cites work: Multicriteria scheduling problems: a survey
cites work: A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
cites work: Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
cites work: Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
cites work: Single-machine common due window assignment and scheduling to minimize the total cost
cites work: CON/SLK due date assignment and scheduling on a single machine with two agents
DOI: 10.1016/J.INS.2018.11.023
description: scientific article; zbMATH DE number 7256966