Scheduling with compressible and stochastic release dates
From MaRDI portal
Publication:336364
DOI10.1016/J.COR.2013.01.011zbMATH Open1348.90344OpenAlexW2000678201MaRDI QIDQ336364FDOQ336364
Jian Zhang, Yiliu Tu, Wensheng Yang
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
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
- The global solver in the LINDO API
- Title not available (Why is that?)
- Reducibility among Combinatorial Problems
- Single machine scheduling with controllable release and processing parameters
- Single machine scheduling problem with a common deadline and resource dependent release dates
- Title not available (Why is that?)
- Models and Algorithms for Stochastic Online Scheduling
- Generalized pairwise interchanges and machine scheduling
- Single machine scheduling of unit-time jobs with controllable release dates
- 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
- 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
- Note: A Separation Principle for a Class of Assemble-to-Order Systems with Expediting
- Stochastic Scheduling with Release Dates and Due Dates
- Single machine sequencing with linear models of release dates
- Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
- A Brownian Approximation of a Production-Inventory System with a Manufacturer That Subcontracts
- Scheduling with Random Service Times
- Optimal control of a dual service rate \(M/M/1\) production-inventory model
- Single machine scheduling problem with controllable processing times and resource dependent release times
Cited In (5)
- 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
- Ergodicity of stochastic magneto-hydrodynamic equations driven by \(\alpha\)-stable noise
- Scheduling to minimize the total compression and late costs
Uses Software
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)
