Single machine sequencing with linear models of release dates

DOI10.1002/(SICI)1520-6750(199802)45:1%3C99::AID-NAV6%3E3.0.CO;2-GMaRDI QIDQ4381878zbMATH OpenOpenAlexFDO

Authors Adam Janiak

Publication date 25 March 1998

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199802)45:1%3C99::aid-nav6%3E3.0.co;2-g

zbMATH Keywords

approximate algorithmsmaximum job completion timepreprocessingrelease datesresource allocationsequence of jobssingle machinestrongly NP-hardworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Publication:3481474
• scientific article; zbMATH DE number 4072697
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Publication:3211101

Cited in

(18)

• Single machine earliness-tardiness scheduling with resource-dependent release dates
• 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 bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Neighbourhood properties in some single processor scheduling problem with variable efficiency and additional resources
• Scheduling with discretely compressible release dates to minimize makespan
• scientific article; zbMATH DE number 4191387 (Why is no real title available?)
• Scheduling with compressible and stochastic release dates
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
• scientific article; zbMATH DE number 4152129 (Why is no real title available?)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
• scientific article; zbMATH DE number 754571 (Why is no real title available?)
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• A single-machine scheduling with a truncated linear deterioration and ready times
• Single-machine scheduling with stepwise tardiness costs and release times
• Single machine scheduling problems with resource dependent release times
• Single machine scheduling problem with controllable processing times and resource dependent release times

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

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