A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(10 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2016.02.005 / rank
Normal rank
 
Property / author
 
Property / author: Rym M'Hallah / rank
Normal rank
 
Property / author
 
Property / author: Rym M'Hallah / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6654172 / rank
 
Normal rank
Property / zbMATH Keywords
 
binary multiple knapsack
Property / zbMATH Keywords: binary multiple knapsack / rank
 
Normal rank
Property / zbMATH Keywords
 
single machine scheduling
Property / zbMATH Keywords: single machine scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
weighted number of tardy jobs
Property / zbMATH Keywords: weighted number of tardy jobs / rank
 
Normal rank
Property / zbMATH Keywords
 
variable neighborhood search
Property / zbMATH Keywords: variable neighborhood search / rank
 
Normal rank
Property / zbMATH Keywords
 
machine maintenance
Property / zbMATH Keywords: machine maintenance / rank
 
Normal rank
Property / zbMATH Keywords
 
machine availability
Property / zbMATH Keywords: machine availability / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MULKNAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2016.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2285736397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with small operator-non-availability periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for parallel machine scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of single machine scheduling to minimize weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch and bound algorithm for minimizing the weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a variable maintenance and linear deteriorating jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for hard multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure-based heuristic for 0-1 multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Variable Neighborhood Search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2016.02.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:55, 9 December 2024

scientific article
Language Label Description Also known as
English
A binary multiple knapsack model for single machine scheduling with machine unavailability
scientific article

    Statements

    A binary multiple knapsack model for single machine scheduling with machine unavailability (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    binary multiple knapsack
    0 references
    single machine scheduling
    0 references
    weighted number of tardy jobs
    0 references
    variable neighborhood search
    0 references
    machine maintenance
    0 references
    machine availability
    0 references
    0 references
    0 references
    0 references

    Identifiers