Iterative beam search algorithms for the permutation flowshop

Aur\'elien Secardin; Luc Libralesso; Pablo Andres Focke; Vincent Jost

REVIEW

Iterative beam search algorithms for the permutation flowshop

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.05800 v1 pith:J26E4CI4 submitted 2020-09-12 cs.AI cs.NEmath.OC

Luc Libralesso , Pablo Andres Focke , Aurélien Secardin , Vincent Jost This is my paper · ORCID

classification cs.AIcs.NEmath.OC

keywords minimizationalgorithmbeambenchmarkbranchingflowshopflowtimeinspired

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branch-and-bounds and a guidance strategy inspired by the LR heuristic. It obtains competitive results, reports many new-best-so-far solutions on the VFR benchmark (makespan minimization) and the Taillard benchmark (flowtime minimization) without using any NEH-based branching or iterative-greedy strategy. The source code is available at: https://gitlab.com/librallu/cats-pfsp.

Discussion (0). Continue with ORCID to comment.

Pith tools