A binary multiple knapsack model for single machine scheduling with machine unavailability
From MaRDI portal
Publication:342369
DOI10.1016/j.cor.2016.02.005zbMath1349.90368OpenAlexW2285736397MaRDI QIDQ342369
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.02.005
machine maintenancesingle machine schedulingvariable neighborhood searchmachine availabilitybinary multiple knapsackweighted number of tardy jobs
Related Items (8)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times ⋮ Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ The assignment and loading transportation problem ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
Uses Software
Cites Work
- Unnamed Item
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- A branch-and-bound algorithm for hard multiple knapsack problems
- Approximation schemes for parallel machine scheduling with availability constraints
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Single-machine scheduling with periodic maintenance to minimize makespan
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Variable neighbourhood search: methods and applications
- An exact algorithm for large multiple knapsack problems
- Heuristic algorithms for the multiple knapsack problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Minimizing the weighted number of tardy jobs on a single machine
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- Single machine scheduling with small operator-non-availability periods
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- Parallel Variable Neighborhood Search
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Algorithms for Scheduling Independent Tasks
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
This page was built for publication: A binary multiple knapsack model for single machine scheduling with machine unavailability
