A real-time order acceptance and scheduling approach for permutation flow shop problems
From MaRDI portal
(Redirected from Publication:320020)
Recommendations
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion
- A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
- The distributed permutation flowshop scheduling problem
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- 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
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Multi-period job selection: Planning work loads to maximize profit
- Optimal two- and three-stage production schedules with set-up time included
- Order acceptance strategies in a production-to-order environment with setup times and due-dates
- Order acceptance using genetic algorithms
- Order acceptance with weighted tardiness
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Quoting Customer Lead Times
- Scheduling flow shops using differential evolution algorithm
- Scheduling with limited machine availability
- Scheduling. Theory, algorithms, and systems.
- Selecting jobs for heavily loaded shop with lateness penalties
- Single Facility Due Date Setting with Multiple Customer Classes
- Some efficient heuristic methods for the flow shop sequencing problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- The capacity planning problem in make-to-order enterprises
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(11)- An appointment scheduling framework to balance the production of blood units from donation
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- A matheuristic for the generalized order acceptance and scheduling problem
- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- Integrated proactive and reactive strategies for sustainable berth allocation and quay crane assignment under uncertainty
- Online order acceptance and scheduling in a single machine environment
- Synchronizing production and delivery in flow shops with time-of-use electricity pricing
This page was built for publication: A real-time order acceptance and scheduling approach for permutation flow shop problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320020)
