Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines

DOI10.47836/mjms.16.3.04OpenAlexW4297349261MaRDI QIDQ6193885

No author found.

Publication date: 19 March 2024

Published in: Malaysian Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47836/mjms.16.3.04

zbMATH Keywords

schedulingparallel machinesbranch-and-boundfuzzy triangular numbermake span

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flow shop scheduling on 2-machines with setup time and single transport facility under fuzzy environment
• Job sequencing with fuzzy processing times
• A state-of-the-art review of parallel-machine scheduling research
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• Complexity of single machine, multi-criteria scheduling problems
• Minimizing the makespan on two identical parallel machines with mold constraints
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• Heuristic approach for \(N\)-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs
• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
• Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines
• Optimal two- and three-stage production schedules with setup times included
• An Algorithm for the Traveling Salesman Problem
• A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines

This page was built for publication: Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines