Efficient algorithms for flexible job shop scheduling with parallel machines

DOI10.1002/nav.21901zbMath1523.90171OpenAlexW3015682257MaRDI QIDQ6093557

Wiesław X. Kubiak, Suresh P. Sethi, Chelliah Skriskandarajah, Unnamed Author, Guo Li

Publication date: 9 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21901

zbMATH Keywords

approximation algorithmmakespanflexible job shop schedulingabsolute worst-case error bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items

A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context, Scheduling with day shifts and breaks, A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem

Cites Work

• Unnamed Item
• Scatter search with path relinking for the flexible job shop scheduling problem
• Solving the job-shop scheduling problem optimally by dynamic programming
• Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• Minimizing maximum lateness in a two-machine unit-time job shop
• Solving the flexible job shop scheduling problem with sequence-dependent setup times
• An efficient algorithm for a job shop problem
• Scheduling with Deadlines and Loss Functions
• Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
• A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
• An Algorithm for Solving the Job-Shop Problem
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• Computational Complexity of Discrete Optimization Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Scheduling parallel machines with inclusive processing set restrictions and job rejection
• Preemptive parallel‐machine scheduling with a common server to minimize makespan
• A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
• An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines