No-wait two-stage flowshop problem with multi-task flexibility of the first machine

DOI10.1016/j.ins.2020.06.052zbMath1478.90038OpenAlexW3040075204WikidataQ98655168 ScholiaQ98655168MaRDI QIDQ2054067

Weitian Tong, Hong Pan, Jueliang Hu, Jianming Dong, Cunkui Ye

Publication date: 30 November 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.06.052

zbMATH Keywords

approximation algorithmflowshopblockingno-waitworst-case performance ratiomulti-task flexibility

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Throughput optimization in two-machine flowshops with flexible operations
• Cyclic scheduling in a robotic production line
• New heuristics for no-wait flowshops to minimize makespan.
• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• A survey of scheduling problems with no-wait in process
• Flow-shop scheduling with flexible processors
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• A two-stage semi-hybrid flowshop problem in graphics processing
• Complexity of flowshop scheduling problems with a new blocking constraint
• A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs
• Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
• A note on scheduling alternative operations in two-machine flowshops
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Scheduling alternative operations in two-machine flow-shops
• Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: No-wait two-stage flowshop problem with multi-task flexibility of the first machine