An uncertain programming model for single machine scheduling problem with batch delivery
DOI10.3934/JIMO.2018058zbMATH Open1438.90116OpenAlexW2800779217WikidataQ129721339 ScholiaQ129721339MaRDI QIDQ2313751FDOQ2313751
Authors: Jiayu Shen, Yuanguo Zhu
Publication date: 23 July 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018058
Recommendations
- Single machine scheduling with batch deliveries
- Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
- Batch delivery scheduling with discretely controllable processing times
- Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cites Work
- Single machine scheduling with batch deliveries
- Complexity of flow shop scheduling problems with transportation constraints
- Scheduling with Fixed Delivery Dates
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints
- Uncertainty theory. An introduction to its axiomatic foundations.
- Supply Chain Scheduling: Batching and Delivery
- A sufficient and necessary condition of uncertainty distribution
- The coordination of scheduling and batch deliveries
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Production scheduling with supply and delivery considerations to minimize the makespan
- Shortest path problem with uncertain arc lengths
- On heuristic solutions for the stochastic flowshop scheduling problem
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
- Stochastic scheduling to minimize expected maximum lateness
- The maximum flow problem of uncertain network
- A linear-quadratic control problem of uncertain discrete-time switched systems
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Title not available (Why is that?)
- Uncertain models on railway transportation planning problem
- Scheduling in a two-stage supply chain with uncertain parameters
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
Cited In (4)
This page was built for publication: An uncertain programming model for single machine scheduling problem with batch delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313751)