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

DOI10.1016/J.INS.2020.06.052MaRDI QIDQ2054067zbMATH OpenOpenAlexWikidataFDO

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

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 algorithmblockingflowshopmulti-task flexibilityno-waitworst-case performance ratio

Mathematics Subject Classification ID

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

Recommendations

• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
• scientific article; zbMATH DE number 6747350
• No-wait flexible flowshop scheduling with no-idle machines
• Approximation algorithms for two-stage flexible flow shop scheduling
• Improved approximation algorithms for two-stage flexible flow shop scheduling

Cites work

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

Cited in

(2)

• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis

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

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