Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon
From MaRDI portal
Publication:879577
DOI10.1016/J.AMC.2006.05.188zbMATH Open1149.90059OpenAlexW2031676209MaRDI QIDQ879577FDOQ879577
Authors: Mehdi Iranpoor, A. Mohamadinia, S. M. T. Fatemi Ghomi 
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.188
Recommendations
- Permutation flow shop scheduling with earliness and tardiness penalties
- Earliness and tardiness flow shop scheduling problems under uncertainty with finite intermediate storage
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- Sequencing with Earliness and Tardiness Penalties: A Review
- Heuristics for minimizing total weighted tardiness in flexible flow shops
Cites Work
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Minimizing the average deviation of job completion times about a common due date
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming
Cited In (3)
This page was built for publication: Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879577)
