Novel model and solution method for flexible job shop scheduling problem with batch processing machines

Cites Work

Unnamed Item
A hybrid evolutionary algorithm to solve the job shop scheduling problem
Fast LP models and algorithms for identical jobs on uniform parallel machines
A branch and bound algorithm for the job-shop scheduling problem
An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
Solving the flexible job shop scheduling problem with sequence-dependent setup times
A batch-oblivious approach for complex job-shop scheduling problems
Effective neighbourhood functions for the flexible job shop problem
A meta-heuristic to solve the just-in-time job-shop scheduling problem
A survey of scheduling with parallel batch (p-batch) processing
A survey of job shop scheduling problem: the types and models
Exact algorithms to minimize makespan on single and parallel batch processing machines
Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
Routing and scheduling in a flexible job shop by tabu search
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
A survey of adaptive large neighborhood search algorithms and applications
A research survey: review of flexible job shop scheduling techniques
An Algorithm for Solving the Job-Shop Problem
Job Shop Scheduling by Simulated Annealing
Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint

This page was built for publication: Novel model and solution method for flexible job shop scheduling problem with batch processing machines