Multicriteria models for just-in-time scheduling
From MaRDI portal
Publication:2997893
DOI10.1080/00207541003733783zbMath1211.90090OpenAlexW1964150623MaRDI QIDQ2997893
Publication date: 10 May 2011
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207541003733783
Related Items
Cites Work
- An improved earliness--tardiness timing algorithm
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Optimal timing of a sequence of tasks with general completion costs
- PERT scheduling with convex cost functions.
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Sequencing with Earliness and Tardiness Penalties: A Review
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Basic Techniques for Lot Streaming
- Lot Streaming in Job-Shop Scheduling
- Optimal timing schedules in earliness-tardiness single machine sequencing
- Flow Shop Lot Streaming
