Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine

DOI10.1080/0305215X.2021.1961761zbMATH Open1523.90193OpenAlexW3195601797MaRDI QIDQ6094568FDOQ6094568

Authors:

Publication date: 10 October 2023

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2021.1961761

Recommendations

• Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• On optimal due date assignment without restriction and resource allocation in group technology scheduling
• Common due-window assignment and group scheduling with position-dependent processing times
• Single machine scheduling problem with multiple due windows assignment in a group technology

zbMATH Keywords

resource allocationgroup schedulingminmaxdue-window assignmentcontrollable processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• A survey of scheduling with controllable processing times
• A survey on scheduling problems with due windows
• Single-machine group scheduling with processing times dependent on position, starting time and allotted resource
• Single-machine group scheduling with deteriorating jobs and allotted resource
• Minmax scheduling problems with a common due-window
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times
• A note: minmax due-date assignment problem with lead-time cost
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Scheduling with a common due-window: polynomially solvable cases
• A common due-data assignment problem on parallel identical machines
• Minmax due-date assignment with a time window for acceptable lead-times
• A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
• Single machine due window assignment resource allocation scheduling with job-dependent learning effect
• Soft due window assignment and scheduling of unit-time jobs on parallel machines
• Minmax scheduling problems with common due-date and completion time penalty
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• A Due-Window Determination In Minmax Scheduling Problems
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
• Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
• Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
• Common due-window assignment and group scheduling with position-dependent processing times

Cited In (10)

• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• Scheduling with multiple common due windows assignment and general position-dependent and resource-dependent processing times
• A note: minmax due-window assignment with fixed earliness-tardiness costs
• A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect
• Common due-window assignment and group scheduling with position-dependent processing times
• Single machine scheduling problem with multiple due windows assignment in a group technology
• Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties
• Minmax scheduling problems with a common due-window
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• On optimal due date assignment without restriction and resource allocation in group technology scheduling

This page was built for publication: Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094568)