While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we in this work mixed integer formulations. We consider a single machine problem that aims at minimizing the weighted sum of earliness–tardiness penalties around common due date. Using natural variables, provide one compact formulation for unrestrictive case and, gene...
