Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

DOI10.1016/J.COR.2010.06.003zbMATH Open1231.90220OpenAlexW2113664547MaRDI QIDQ709154FDOQ709154

Authors: 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

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

zbMATH Keywords

integer programmingschedulingsingle machinebranch-and-boundorder acceptancefirm planned orders

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Techniques for scheduling with rejection
• An efficient cost scaling algorithm for the assignment problem
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• An exact algorithm for single-machine scheduling without machine idle time
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• Due date management policies
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• A hybrid policy for order acceptance in batch process industries
• Order acceptance using genetic algorithms
• Multi-period job selection: Planning work loads to maximize profit
• Selecting jobs for heavily loaded shop with lateness penalties
• Dynamic order acceptance and capacity planning on a single bottleneck resource
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Title not available (Why is that?)
• Order acceptance with weighted tardiness
• Job selection in a heavily loaded shop
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• Time-indexed formulations and the total weighted tardiness problem
• Minimizing Total Costs in One-Machine Scheduling
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Algorithms and Data Structures
• Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
• Greedy solutions of selection and ordering problems
• Towards intelligent manufacturing planning and control systems
• Dynamic management of a portfolio of orders. (Abstract of thesis)
• On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups

Cited In (26)

• 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
• 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
• Exact methods for order acceptance and scheduling on unrelated parallel machines
• Order acceptance and due-date quotation in low machine rates
• 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
• 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
• 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
• A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
• 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)