Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
From MaRDI portal
Publication:709154
Recommendations
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- A matheuristic for the generalized order acceptance and scheduling problem
- Order acceptance with weighted tardiness
- Minimizing maximum delivery completion time for order scheduling with rejection
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A hybrid policy for order acceptance in batch process industries
- Algorithms and Data Structures
- An efficient cost scaling algorithm for the assignment problem
- An exact algorithm for single-machine scheduling without machine idle time
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Due date management policies
- Dynamic management of a portfolio of orders. (Abstract of thesis)
- Dynamic order acceptance and capacity planning on a single bottleneck resource
- Greedy solutions of selection and ordering problems
- Job selection in a heavily loaded shop
- Minimizing Total Costs in One-Machine Scheduling
- Multi-period job selection: Planning work loads to maximize profit
- Network flows. Theory, algorithms, and applications.
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
- 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
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Order acceptance using genetic algorithms
- Order acceptance with weighted tardiness
- Selecting jobs for heavily loaded shop with lateness penalties
- Techniques for scheduling with rejection
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Time-indexed formulations and the total weighted tardiness problem
- Towards intelligent manufacturing planning and control systems
Cited in
(32)- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning
- Minimizing maximum delivery completion time for order scheduling with rejection
- A survey on offline scheduling with rejection
- A local search enhanced logic-based benders decomposition approach for order acceptance and scheduling problem with preemption
- Online order acceptance and scheduling in a single machine environment
- Logic-based Benders decomposition for order acceptance and scheduling on heterogeneous factories with carbon caps
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
- Bicriteria order acceptance and scheduling with consideration of fill rate
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Order acceptance and due-date quotation in low machine rates
- A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- An improved heuristic for parallel machine scheduling with rejection
- Order acceptance and scheduling with delivery under generalized parameters
- 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
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Diversity controlling genetic algorithm for order acceptance and scheduling problem
- Benders decompositions for order acceptance and scheduling in additive manufacturing
- Order acceptance with weighted tardiness
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
- A matheuristic for the generalized order acceptance and scheduling problem
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Order acceptance and scheduling with consideration of service level
- Order acceptance and scheduling with machine availability constraints
- Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints
This page was built for publication: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709154)
