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.90220MaRDI QIDQ709154
Roel Leus, Fabrice Talla Nobibon
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; scheduling; branch-and-bound; single machine; order acceptance; firm planned orders
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
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, A survey on offline scheduling with rejection, Order acceptance and scheduling with consideration of service level, Metaheuristics for a scheduling problem with rejection and tardiness penalties, Order acceptance and scheduling with machine availability constraints, An improved heuristic for parallel machine scheduling with rejection
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
