A polynomial approximation scheme for problem F2/r_ j/C_max

DOI10.1016/S0167-6377(96)00049-1MaRDI QIDQ1376266zbMATH OpenDBLPWikidataFDO

Authors M. Y. Kovalyov, Frank Werner

Publication date 6 July 1998

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-6377(96)00049-1

zbMATH Keywords

polynomial approximation schemerelease datestwo-machine flow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A scheme of approximation solution of problem 1 |r j|L max
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• Approximating Min-Max (Regret) Versions of Some Polynomial Problems
• Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
• An approximate approach of global optimization for polynomial programming problems
• scientific article; zbMATH DE number 5823944
• Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem
• Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• Two methods for the maximization of homogeneous polynomials over the simplex

Cites work

• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• Combinatorial Problems: Reductibility and Approximation
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Cited in

(8)

• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
• An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• A scheme of approximation solution of problem 1 |r j|L max
• PTAS for a two-machine flow-shop scheduling problem with release dates and transportation times delay
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
• Polynomial-time approximation schemes for scheduling problems with time lags

This page was built for publication: A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)

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