Exact methods for order acceptance and scheduling on unrelated parallel machines

DOI10.1016/j.cor.2018.12.016zbMath1458.90369OpenAlexW2906460614MaRDI QIDQ1725610

Shijin Wang, Benyan Ye

Publication date: 14 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.016

zbMATH Keywords

branch-and-boundunrelated parallel machinesmixed-integer programmingorder acceptance and scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Unnamed Item ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling

Cites Work

• A real-time order acceptance and scheduling approach for permutation flow shop problems
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
• A survey on offline scheduling with rejection
• A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
• Permutation flow shop scheduling with order acceptance and weighted tardiness
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Order acceptance with weighted tardiness
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Order acceptance using genetic algorithms
• Multi-period job selection: Planning work loads to maximize profit
• Job selection in a heavily loaded shop
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
• Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
• Bicriteria order acceptance and scheduling with consideration of fill rate
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Scheduling unrelated parallel machines with optional machines and jobs selection
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
• Scheduling jobs on parallel machines to minimize a regular step total cost function
• Selecting jobs for heavily loaded shop with lateness penalties
• An improved heuristic for parallel machine scheduling with rejection
• 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
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• Solving Parallel Machine Scheduling Problems by Column Generation
• Scheduling parallel machines with inclusive processing set restrictions and job rejection
• Multiprocessor Scheduling with Rejection
• A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Scheduling

This page was built for publication: Exact methods for order acceptance and scheduling on unrelated parallel machines