A real-time order acceptance and scheduling approach for permutation flow shop problems

DOI10.1016/j.ejor.2015.06.018zbMath1346.90383MaRDI QIDQ320020

Humyun Fuad Rahman, Ruhul A. Sarker, Daryl L. Essam

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.018

zbMATH Keywords

genetic algorithmmemetic algorithmflow shop schedulingrandom order arrivalreal-time multiple-order scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Dispatching problems for parallel machines in the TFT‐LCD assembly process, An appointment scheduling framework to balance the production of blood units from donation, Exact methods for order acceptance and scheduling on unrelated parallel machines, A matheuristic for the generalized order acceptance and scheduling problem, Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics

Cites Work

• A discrete inter-species cuckoo search for flowshop scheduling problems
• Permutation flow shop scheduling with order acceptance and weighted tardiness
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Scheduling flow shops using differential evolution algorithm
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Order acceptance with weighted tardiness
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
• The capacity planning problem in make-to-order enterprises
• Order acceptance using genetic algorithms
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
• Multi-period job selection: Planning work loads to maximize profit
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• A comprehensive review and evaluation of permutation flowshop heuristics
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Scheduling with limited machine availability
• Benchmarks for basic scheduling problems
• Selecting jobs for heavily loaded shop with lateness penalties
• Optimal two- and three-stage production schedules with setup times included
• A methodology for planning and controlling workload in a job-shop: a four-way decision-making problem
• A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
• Order acceptance strategies in a production-to-order environment with setup times and due-dates
• The Complexity of Flowshop and Jobshop Scheduling
• Quoting Customer Lead Times
• Single Facility Due Date Setting with Multiple Customer Classes
• Scheduling