Order acceptance using genetic algorithms
From MaRDI portal
Publication:1000954
DOI10.1016/j.cor.2008.04.010zbMath1179.90151OpenAlexW2076768957MaRDI QIDQ1000954
Walter O. Rom, Susan A. Slotnick
Publication date: 12 February 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://engagedscholarship.csuohio.edu/bus_facpub/53
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Artificial intelligence (68T99)
Related Items
Minimizing maximum delivery completion time for order scheduling with rejection, Order acceptance and due-date quotation in low machine rates, An improved heuristic for parallel machine scheduling with rejection, Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times, 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, 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, Rationing mechanisms and inventory control-policy parameters for a divergent supply chain operating with lost sales and costs of review, 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, 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, Metaheuristics for a scheduling problem with rejection and tardiness penalties, 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
- Unnamed Item
- Unnamed Item
- A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A heuristic genetic algorithm for product portfolio planning
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Order acceptance with weighted tardiness
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Genetic algorithms to solve the cover printing problem
- Job selection and sequencing on a single machine in a random environment
- Multicriteria order acceptance decision support in over-demanded job shops: A neural network approach
- Multi-period job selection: Planning work loads to maximize profit
- Job selection in a heavily loaded shop
- Competitive genetic algorithms for the open-shop scheduling problem
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Workload based order acceptance in job shop environments
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Robustness of capacity rationing policies
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- Scheduling flexible flow lines with sequence-dependent setup times
- An evolutionary algorithm approach to the share of choices problem in the product line design
- Flow-shop scheduling for three serial stations with the last two duplicate
- A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- A genetic algorithm approach to a nurse rerostering problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Selecting jobs for heavily loaded shop with lateness penalties
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
- Bankruptcy theory development and classification via genetic programming
- Evolutionary bi-objective optimisation in the elevator car routing problem
- Pricing and scheduling decisions with leadtime flexibility
- A continuous approach to considering uncertainty in facility design
- Minimizing Total Tardiness on One Machine is NP-Hard
- 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
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A genetic algorithm for flow shop scheduling problems
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- 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
