Scheduling with compressible and stochastic release dates

DOI10.1016/J.COR.2013.01.011MaRDI QIDQ336364zbMATH OpenOpenAlexFDO

Authors Jian Zhang, Wensheng Yang, Yiliu Tu

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.01.011

zbMATH Keywords

single-machine schedulingcompressible and stochastic release datesdue-date guarantee

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Scheduling with discretely compressible release dates to minimize makespan
• Single machine scheduling with randomly compressible processing times
• Scheduling to minimize the total compression and late costs
• Dynamic scheduling of stochastic jobs on a single machine
• Stochastic scheduling to minimize expected maximum lateness

Cites work

• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• A Brownian Approximation of a Production-Inventory System with a Manufacturer That Subcontracts
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Dynamic pricing and lead-time quotation for a multiclass make-to-order queue
• Generalized pairwise interchanges and machine scheduling
• Models and Algorithms for Stochastic Online Scheduling
• Note: A Separation Principle for a Class of Assemble-to-Order Systems with Expediting
• Optimal control of a dual service rate \(M/M/1\) production-inventory model
• Reducibility among combinatorial problems
• Scheduling with Random Service 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 earliness-tardiness scheduling with resource-dependent release dates
• Single machine scheduling of unit-time jobs with controllable release dates
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Single machine scheduling problem with controllable processing times and resource dependent release times
• Single machine scheduling with controllable release and processing parameters
• Single machine sequencing with linear models of release dates
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Stochastic Scheduling with Release Dates and Due Dates
• The global solver in the LINDO API

Cited in

(7)

• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
• Online scheduling problems with flexible release dates: applications to infrastructure restoration
• Ergodicity of stochastic magneto-hydrodynamic equations driven by -stable noise
• Scheduling with discretely compressible release dates to minimize makespan
• Scheduling to minimize the total compression and late costs

Describes a project that uses

Uses Software

• LINDOGlobal
• MINLP
• LINDO

This page was built for publication: Scheduling with compressible and stochastic release dates

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