Bicriterion scheduling with a negotiable common due window and resource-dependent processing times

DOI10.1016/j.ins.2018.11.023zbMath1443.90195OpenAlexW2901569433MaRDI QIDQ2004709

Zhiwu Li, Du-Juan Wang

Publication date: 7 October 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.11.023

zbMATH Keywords

schedulingPareto-optimal pointcommon due-window assignmentresource-dependent processing times

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

Due-window assignment scheduling in the proportionate flow shop setting ⋮ Bicriterion scheduling with truncated learning effects and convex controllable processing times ⋮ Single machine resource allocation scheduling problems with deterioration effect and general positional effect ⋮ Due-window assignment scheduling problem with stochastic processing times ⋮ Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Cites Work

• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Scheduling identical jobs and due-window on uniform machines
• Determination of common due window location in a single machine scheduling problem
• Minimization of the makespan in a two-machine problem under given resource constraints
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• Soft due window assignment and scheduling of unit-time jobs on parallel machines
• Single-machine common due window assignment and scheduling to minimize the total cost
• A survey of scheduling with controllable processing times
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Two-machine open shop problem with controllable processing times
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
• Multicriteria scheduling problems: a survey
• Resource Management in Machine Scheduling Problems: A Survey
• Common due window size and location determination in a single machine scheduling problem
• Algorithms for Scheduling Independent Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• CON/SLK due date assignment and scheduling on a single machine with two agents
• A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
• Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This page was built for publication: Bicriterion scheduling with a negotiable common due window and resource-dependent processing times