Order acceptance with weighted tardiness
From MaRDI portal
Publication:878579
DOI10.1016/j.cor.2005.11.012zbMath1185.90093OpenAlexW2066928161MaRDI QIDQ878579
Susan A. Slotnick, Thomas E. Morton
Publication date: 26 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.012
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (30)
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 ⋮ An improved heuristic for parallel machine scheduling with rejection ⋮ Order selection and capacity planning in MCS with chain-to-chain collaboration ⋮ An integrated fuzzy TOPSIS-knapsack problem model for order selection in a bakery ⋮ Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times ⋮ 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 ⋮ Parallel machine scheduling with restricted job rejection ⋮ 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 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 ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ An Artificial Bee Colony Based Hyper-heuristic for the Single Machine Order Acceptance and Scheduling Problem ⋮ Diversity controlling genetic algorithm for order acceptance and scheduling problem ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Order acceptance and scheduling with consideration of service level ⋮ A decision support system for order acceptance/rejection in hybrid MTS/MTO production systems ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Order acceptance for motorail transportation with uncertain parameters ⋮ Single CNC machine scheduling with controllable processing times and multiple due dates ⋮ Order acceptance using genetic algorithms ⋮ A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime ⋮ A matheuristic for the generalized order acceptance and scheduling problem
Uses Software
Cites Work
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Job selection and sequencing on a single machine in a random environment
- Multi-period job selection: Planning work loads to maximize profit
- Job selection in a heavily loaded shop
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Workload based order acceptance in job shop environments
- Job shop scheduling with beam search
- Robustness of capacity rationing policies
- Project scheduling with inventory constraints
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- An evolutionary algorithm approach to the share of choices problem in the product line design
- Selecting jobs for heavily loaded shop with lateness penalties
- Pricing and scheduling decisions with leadtime flexibility
- Minimizing Total Tardiness on One Machine is NP-Hard
- The Single Machine Early/Tardy Problem
- Order acceptance strategies in a production-to-order environment with setup times and due-dates
- A cost model for justifying the acceptance of rush orders
- An experimental comparison of capacity rationing models
- Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics
- Improved lower bounds for the early/tardy scheduling problem with no idle time
- Stochastic assembly line balancing using beam search
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study
- Greedy solutions of selection and ordering problems
This page was built for publication: Order acceptance with weighted tardiness
