Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
DOI10.1016/J.INS.2018.11.023zbMATH Open1443.90195OpenAlexW2901569433MaRDI QIDQ2004709FDOQ2004709
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
Multi-objective and goal programming (90C29) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Mixed integer programming (90C11)
Cites Work
- A survey of scheduling with controllable processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Algorithms for Scheduling Independent Tasks
- Multicriteria scheduling problems: a survey
- Single machine batch scheduling to minimize total completion time and resource consumption costs
- Common due window size and location determination in a single machine scheduling problem
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
- Single-machine common due window assignment and scheduling to minimize the total cost
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
- Scheduling identical jobs and due-window on uniform machines
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Determination of common due window location in a single machine scheduling problem
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
- CON/SLK due date assignment and scheduling on a single machine with two agents
- Minimization of the makespan in a two-machine problem under given resource constraints
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Resource Management in Machine Scheduling Problems: A Survey
- Two-machine open shop problem with controllable processing times
Cited In (7)
- Due-window assignment scheduling in the proportionate flow shop setting
- Bicriterion scheduling with truncated learning effects and convex controllable processing times
- Due-window assignment scheduling problem with stochastic processing times
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads
- Bicriteria Common Flow Allowance Scheduling with Aging Effect, Convex Resource Allocation, and a Rate-Modifying Activity on a Single Machine
- Bi-criteria scheduling against restrictive common due dates using a multi-objective differential evolution algorithm
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
This page was built for publication: Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004709)
