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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
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

Latest revision as of 00:00, 13 July 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