Two MILP models for the N × M SDST flowshop sequencing problem
From MaRDI portal
Publication:2758493
DOI10.1080/00207540010029433zbMath1009.90042OpenAlexW2067805476MaRDI QIDQ2758493
F. T. Tseng, Edward F. jun. Stafford
Publication date: 22 April 2003
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540010029433
mixed-integer linear programmingsequence-dependent set-up timesassignment-problemflowshop sequencing problem
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items
Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint, Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling, Solving permutation flow shop scheduling problem with sequence-independent setup time, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry, A survey of scheduling problems with setup times or costs, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Flowshop scheduling problem with parallel semi-lines and final synchronization operation, Mathematical models for preemptive shop scheduling problems, A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, Flowshop-scheduling problems with makespan criterion: a review, Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning, Two models for a family of flowshop sequencing problems
