Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines

DOI10.47836/MJMS.16.3.04MaRDI QIDQ6193885zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Flow shop scheduling on 2-machines with setup time and single transport facility under fuzzy environment
• Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness
• Scheduling of flow shop problems on 3 machines in fuzzy environment with double transport facility
• Parallel machine scheduling models with fuzzy processing times
• OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP

Cites work

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

Cited in

(1)

• Applying the diamond product of graphs to the round robin tournament scheduling problem

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

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