scientific article

zbMath0968.90521MaRDI QIDQ2743969

George L. Vairaktarakis, Chung-Yee Lee

Publication date: 18 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (26)

Two-machine flow shop scheduling with two criteria: maximum earliness and makespan ⋮ MP or not MP: that is the question ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ Scheduling with time-dependent discrepancy times ⋮ A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. ⋮ Proportionate flow shop with controllable processing times ⋮ Scheduling to tradeoff between the number and the length of accepted jobs ⋮ Bicriterion scheduling with equal processing times on a batch processing machine ⋮ Uniform parallel machine scheduling problems with fixed machine cost ⋮ A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times ⋮ Single-machine scheduling under the job rejection constraint ⋮ Minimizing makespan subject to minimum flowtime on two identical parallel machines ⋮ Multicriteria scheduling problems: a survey ⋮ Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs ⋮ Minimizing makespan subject to minimum total flow-time on identical parallel machines ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs ⋮ Using genetic algorithms for single-machine bicriteria scheduling problems

This page was built for publication: