Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
From MaRDI portal
Publication:709154
DOI10.1016/j.cor.2010.06.003zbMath1231.90220OpenAlexW2113664547MaRDI QIDQ709154
Fabrice Talla Nobibon, Roel Leus
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.06.003
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (24)
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization ⋮ Order acceptance and due-date quotation in low machine rates ⋮ An improved heuristic for parallel machine scheduling with rejection ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Resource loading with time windows ⋮ 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 ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics ⋮ A survey on offline scheduling with rejection ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints ⋮ Diversity controlling genetic algorithm for order acceptance and scheduling problem ⋮ A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ Order acceptance and scheduling with consideration of service level ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime ⋮ A matheuristic for the generalized order acceptance and scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic management of a portfolio of orders. (Abstract of thesis)
- A hybrid policy for order acceptance in batch process industries
- Order acceptance with weighted tardiness
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- Order acceptance using genetic algorithms
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- Multi-period job selection: Planning work loads to maximize profit
- Job selection in a heavily loaded shop
- Towards intelligent manufacturing planning and control systems
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- An efficient cost scaling algorithm for the assignment problem
- An exact algorithm for single-machine scheduling without machine idle time
- Selecting jobs for heavily loaded shop with lateness penalties
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- Dynamic order acceptance and capacity planning on a single bottleneck resource
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- Minimizing Total Costs in One-Machine Scheduling
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Techniques for scheduling with rejection
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Algorithms and Data Structures
- Greedy solutions of selection and ordering problems
This page was built for publication: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
