scientific article; zbMATH DE number 830014

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199512)42:8<1263::AID-NAV3220420810>3.0.CO;2-A" /><1263::AID-NAV3220420810>3.0.CO;2-A 10.1002/1520-6750(199512)42:8<1263::AID-NAV3220420810>3.0.CO;2-AzbMath0841.90074MaRDI QIDQ4859582

Paolo Baracco, Raffaele di Tullio, Roberto Tadei, Wlodzimierz Szwarc, Frederico Della Croce

Publication date: 29 July 1996

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

zbMATH Keywords

branch-and-boundsingle machineweighted sum of quadratic completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ The local-global conjecture for scheduling with non-linear cost ⋮ Generalized pairwise interchanges and machine scheduling ⋮ Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ A scheduling problem with job values given as a power function of their completion times ⋮ Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem ⋮ Solution of the generalized Townsend single machine scheduling model ⋮ An improved precedence rule for single machine sequencing problems with quadratic penalty ⋮ For the airplane refueling problem local precedence implies global precedence

This page was built for publication: