Single machine sequencing with linear models of release dates

DOI<99::AID-NAV6>3.0.CO;2-G 10.1002/(SICI)1520-6750(199802)45:1<99::AID-NAV6>3.0.CO;2-GzbMath0897.90127OpenAlexW2095255929MaRDI QIDQ4381878

Adam Janiak

Publication date: 25 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199802)45:1<99::aid-nav6>3.0.co;2-g

zbMATH Keywords

single machineresource allocationrelease datesworst-case analysisstrongly NP-hardapproximate algorithmspreprocessingmaximum job completion timesequence of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Scheduling with compressible and stochastic release dates ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ Single machine scheduling problems with resource dependent release times ⋮ Single machine scheduling problem with controllable processing times and resource dependent release times ⋮ Scheduling with controllable release dates and processing times: Makespan minimization ⋮ Scheduling with controllable release dates and processing times: total completion time minimization ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ A single-machine scheduling with a truncated linear deterioration and ready times ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE ⋮ A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates ⋮ SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN ⋮ Single machine earliness-tardiness scheduling with resource-dependent release dates

This page was built for publication: Single machine sequencing with linear models of release dates