Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129801663, #quickstatements; #temporary_batch_1724714018853
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2806735062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan for the flow shop scheduling problem with availability constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine group scheduling problem with blocking and anticipatory setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounded dynamic programming algorithm for solving the blocking flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony system for permutation flow-shop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129801663 / rank
 
Normal rank

Latest revision as of 00:35, 27 August 2024

scientific article
Language Label Description Also known as
English
Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
scientific article

    Statements

    Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (English)
    0 references
    3 March 2020
    0 references
    flow shop scheduling problem
    0 references
    mixed model sequencing problem
    0 references
    mixed model assembly lines
    0 references
    overall demand plan
    0 references
    mixed integer linear programming
    0 references
    0 references

    Identifiers