Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

Exact and approximate algorithms for high-multiplicity parallel machine scheduling
On polynomial solvability of the high multiplicity total weighted tardiness problem
Parallel machine scheduling with high multiplicity
Using quadratic programming to solve high multiplicity scheduling problems on parallel machines

Cited in

(47)

Exact and approximate algorithms for high-multiplicity parallel machine scheduling
An algorithm for the detection and construction of Monge sequences
A polynomial algorithm for an integer quadratic non-separable transportation problem
On polynomial solvability of the high multiplicity total weighted tardiness problem
The maximum deviation just-in-time scheduling problem.
Families of non-IRUP instances of the one-dimensional cutting stock problem
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
A polynomial algorithm for lot-size scheduling of two type tasks.
Scheduling with safety distances
Heuristics for the integer one-dimensional cutting stock problem: A computational study
Many-visits TSP revisited
Cyclic lot-sizing problems with sequencing costs
Feasibility criteria for high-multiplicity partitioning problems
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
A note on the complexity of the problem of two-agent scheduling on a single machine
Packet scheduling in third-generation mobile systems with UTRA-TDD air interface
Batch scheduling in a two-level supply chain -- a focus on the supplier
On the high multiplicity traveling salesman problem
Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
A framework for the complexity of high-multiplicity scheduling problems
An asymptotically exact algorithm for the high-multiplicity bin packing problem
Parameterized complexity of configuration integer programs
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
An alternative approach for proving the NP-hardness of optimization problems
The assignment problem with nearly Monge arrays and incompatible partner indices
High-multiplicity scheduling on one machine with forbidden start and completion times
Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
Scheduling with periodic availability constraints and irregular cost functions
High Multiplicity in Earliness-Tardiness Scheduling
Multiplicity and complexity issues in contemporary production scheduling
Many Visits TSP Revisited
Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
Scheduling a proportionate flow shop of batching machines
Parallel machine scheduling with high multiplicity
Scheduling jobshops with some identical or similar jobs
A fluid approach to large volume job shop scheduling
High-multiplicity \(N\)-fold IP via configuration LP
Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines
Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
Exact and approximate algorithms for high-multiplicity scheduling with rejection on parallel machines
Minimizing the sojourn time of open shop scheduling problems with unit-time operations
A brief history of parameterized algorithms for block-structured integer programs (invited talk)
Optimal packet-to-slot assignment in mobile telecommunications
Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
High-multiplicity cyclic job shop scheduling

This page was built for publication: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980518)