Flexible job shop scheduling problem for parallel batch processing machine with compatible job families

DOI10.1016/J.APM.2016.12.034MaRDI QIDQ2290149zbMATH OpenOpenAlexFDO

Authors Andy Ham

Publication date 27 January 2020

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2016.12.034

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Recommendations

• MIP formulations and heuristics for solving parallel batching problems
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• Efficient algorithms for flexible job shop scheduling with parallel machines
• Evaluation of mathematical models for flexible job-shop scheduling problems
• A survey of scheduling with parallel batch (p-batch) processing

Cites work

• A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
• A global MILP model for FMS scheduling
• Evaluation of mathematical models for flexible job-shop scheduling problems
• Flexible job shop scheduling with overlapping in operations
• MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
• Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• Modelling and heuristics of FMS scheduling with multiple objectives
• On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming
• Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
• Scheduling in a production environment with multiple process plans per job
• The finite horizon economic lot scheduling in flexible flow lines

Cited in

(9)

• Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems
• Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint
• A fine-grained parallel algorithm for the cyclic flexible job shop problem
• A survey of job shop scheduling problem: the types and models
• Novel model and solution method for flexible job shop scheduling problem with batch processing machines
• Shop scheduling in manufacturing environments: a review
• An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets
• A survey of scheduling with parallel batch (p-batch) processing
• MIP formulations and heuristics for solving parallel batching problems

This page was built for publication: Flexible job shop scheduling problem for parallel batch processing machine with compatible job families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290149)