Bicriterion scheduling with truncated learning effects and convex controllable processing times

DOI10.1111/itor.12888OpenAlexW3094740768MaRDI QIDQ6070521

Fuqiang Li, Ji-Bo Wang, Ping Ji, Dan-Yang Lv, Unnamed Author

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12888

zbMATH Keywords

heuristicsschedulingcombinatorial optimizationbranch-and-boundcontrollable processing timetruncated learning effect

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (15)

Scheduling jobs with general truncated learning effects including proportional setup times ⋮ Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times ⋮ Slack due window assignment scheduling in the single-machine with controllable processing times ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components ⋮ Resource dependent scheduling with truncated learning effects ⋮ Research on delivery times scheduling with truncated learning effects ⋮ Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times ⋮ Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect ⋮ Study on resource allocation scheduling problem with learning factors and group technology ⋮ Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function ⋮ Due-window assignment scheduling with learning and deterioration effects ⋮ Resource allocation scheduling with deteriorating jobs and position-dependent workloads ⋮ Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times ⋮ Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects

Cites Work

• Unnamed Item
• Minimizing the total completion time in a single-machine scheduling problem with a learning effect
• Single-machine scheduling with learning considerations
• Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• Scheduling with general job-dependent learning curves.
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
• Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
• A survey of scheduling with controllable processing times
• Optimal due-date assignment problem with learning effect and resource-dependent processing times
• Single machine scheduling with truncated job-dependent learning effect
• A state-of-the-art review on scheduling with learning effects
• Tri-criteria single machine scheduling model with release times and learning factor
• Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A note on resource allocation scheduling with position-dependent workloads
• Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
• Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Research on m‐machine flow shop scheduling with truncated learning effects

This page was built for publication: Bicriterion scheduling with truncated learning effects and convex controllable processing times