A binary multiple knapsack model for single machine scheduling with machine unavailability
From MaRDI portal
(Redirected from Publication:342369)
Recommendations
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Bi-criteria scheduling on multiple machines subject to machine availability constraints
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A branch-and-bound algorithm for hard multiple knapsack problems
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Algorithms for Scheduling Independent Tasks
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An exact algorithm for large multiple knapsack problems
- Approximation schemes for parallel machine scheduling with availability constraints
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- Heuristic algorithms for the multiple knapsack problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Minimizing the weighted number of tardy jobs on a single machine
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Parallel Variable Neighborhood Search
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine
- Single machine scheduling with small operator-non-availability periods
- Single-machine scheduling with periodic maintenance to minimize makespan
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Variable neighbourhood search: methods and applications
Cited in
(9)- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Mathematical models and decomposition methods for the multiple knapsack problem
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Tug scheduling for hinterland barge transport: a branch-and-price approach
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
- The assignment and loading transportation problem
- Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
This page was built for publication: A binary multiple knapsack model for single machine scheduling with machine unavailability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342369)
