// Copyright 2010-2017 Google
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// This model implements a simple jobshop problem.
//
// A jobshop is a standard scheduling problem where you must schedule a
// set of jobs on a set of machines.  Each job is a sequence of tasks
// (a task can only start when the preceding task finished), each of
// which occupies a single specific machine during a specific
// duration. Therefore, a job is simply given by a sequence of pairs
// (machine id, duration).

// The objective is to minimize the 'makespan', which is the duration
// between the start of the first task (across all machines) and the
// completion of the last task (across all machines).
//
// This will be modelled by sets of intervals variables (see class
// IntervalVar in constraint_solver/constraint_solver.h), one per
// task, representing the [start_time, end_time] of the task.  Tasks
// in the same job will be linked by precedence constraints.  Tasks on
// the same machine will be covered by Sequence constraints.
//
// Search will then be applied on the sequence constraints.

#include <cstdio>
#include <cstdlib>

#include "examples/cpp/flexible_jobshop.h"
#include "ortools/base/commandlineflags.h"
#include "ortools/base/integral_types.h"
#include "ortools/base/logging.h"
#include "ortools/base/stringprintf.h"
#include "ortools/constraint_solver/constraint_solver.h"
#include "ortools/util/string_array.h"

DEFINE_string(data_file, "", "A flexible shobshop problem (.fjs).");
DEFINE_int32(time_limit_in_ms, 0, "Time limit in ms, 0 means no limit.");

namespace operations_research {

struct TaskAlternative {
  explicit TaskAlternative(int j) : job_id(j), alternative_variable(nullptr) {}
  int job_id;
  std::vector<IntervalVar*> intervals;
  IntVar* alternative_variable;
};

void FlexibleJobshop(const FlexibleJobShopData& data) {
  Solver solver("flexible_jobshop");
  const int machine_count = data.machine_count();
  const int job_count = data.job_count();
  const int horizon = data.horizon();

  LOG(INFO) << data.DebugString();
  // ----- Creates all Intervals and vars -----

  // Stores all tasks attached interval variables per job.
  std::vector<std::vector<TaskAlternative>> jobs_to_tasks(job_count);
  // machines_to_tasks stores the same interval variables as above, but
  // grouped my machines instead of grouped by jobs.
  std::vector<std::vector<IntervalVar*>> machines_to_tasks(machine_count);

  // Creates all individual interval variables.
  for (int job_id = 0; job_id < job_count; ++job_id) {
    const std::vector<FlexibleJobShopData::Task>& tasks =
        data.TasksOfJob(job_id);
    for (int task_index = 0; task_index < tasks.size(); ++task_index) {
      const FlexibleJobShopData::Task& task = tasks[task_index];
      CHECK_EQ(job_id, task.job_id);
      jobs_to_tasks[job_id].push_back(TaskAlternative(job_id));
      const bool optional = task.machines.size() > 1;
      std::vector<IntVar*> active_variables;
      for (int alt = 0; alt < task.machines.size(); ++alt) {
        const int machine_id = task.machines[alt];
        const int duration = task.durations[alt];
        const std::string name =
            StringPrintf("J%dI%dA%dM%dD%d", task.job_id, task_index, alt,
                         machine_id, duration);
        IntervalVar* const interval = solver.MakeFixedDurationIntervalVar(
            0, horizon, duration, optional, name);
        jobs_to_tasks[job_id].back().intervals.push_back(interval);
        machines_to_tasks[machine_id].push_back(interval);
        if (optional) {
          active_variables.push_back(interval->PerformedExpr()->Var());
        }
      }
      std::string alternative_name = StringPrintf("J%dI%d", job_id, task_index);
      IntVar* alt_var =
          solver.MakeIntVar(0, task.machines.size() - 1, alternative_name);
      jobs_to_tasks[job_id].back().alternative_variable = alt_var;
      if (optional) {
        solver.AddConstraint(solver.MakeMapDomain(alt_var, active_variables));
      }
    }
  }

  // Creates precedences inside jobs.
  for (int job_id = 0; job_id < job_count; ++job_id) {
    const int task_count = jobs_to_tasks[job_id].size();
    for (int task_index = 0; task_index < task_count - 1; ++task_index) {
      const TaskAlternative& task_alt1 = jobs_to_tasks[job_id][task_index];
      const TaskAlternative& task_alt2 = jobs_to_tasks[job_id][task_index + 1];
      for (int alt1 = 0; alt1 < task_alt1.intervals.size(); ++alt1) {
        IntervalVar* const t1 = task_alt1.intervals[alt1];
        for (int alt2 = 0; alt2 < task_alt2.intervals.size(); ++alt2) {
          IntervalVar* const t2 = task_alt2.intervals[alt2];
          Constraint* const prec =
              solver.MakeIntervalVarRelation(t2, Solver::STARTS_AFTER_END, t1);
          solver.AddConstraint(prec);
        }
      }
    }
  }

  // Collect alternative variables.
  std::vector<IntVar*> all_alternative_variables;
  for (int job_id = 0; job_id < job_count; ++job_id) {
    const int task_count = jobs_to_tasks[job_id].size();
    for (int task_index = 0; task_index < task_count; ++task_index) {
      IntVar* const alternative_variable =
          jobs_to_tasks[job_id][task_index].alternative_variable;
      if (!alternative_variable->Bound()) {
        all_alternative_variables.push_back(alternative_variable);
      }
    }
  }

  // Adds disjunctive constraints on unary resources, and creates
  // sequence variables. A sequence variable is a dedicated variable
  // whose job is to sequence interval variables.
  std::vector<SequenceVar*> all_sequences;
  for (int machine_id = 0; machine_id < machine_count; ++machine_id) {
    const std::string name = StringPrintf("Machine_%d", machine_id);
    DisjunctiveConstraint* const ct =
        solver.MakeDisjunctiveConstraint(machines_to_tasks[machine_id], name);
    solver.AddConstraint(ct);
    all_sequences.push_back(ct->MakeSequenceVar());
  }

  // Creates array of end_times of jobs.
  std::vector<IntVar*> all_ends;
  for (int job_id = 0; job_id < job_count; ++job_id) {
    const TaskAlternative& task_alt = jobs_to_tasks[job_id].back();
    for (int alt = 0; alt < task_alt.intervals.size(); ++alt) {
      IntervalVar* const t = task_alt.intervals[alt];
      all_ends.push_back(t->SafeEndExpr(-1)->Var());
    }
  }

  // Objective: minimize the makespan (maximum end times of all tasks)
  // of the problem.
  IntVar* const objective_var = solver.MakeMax(all_ends)->Var();
  OptimizeVar* const objective_monitor = solver.MakeMinimize(objective_var, 1);

  // ----- Search monitors and decision builder -----

  // This decision builder will assign all alternative variables.
  DecisionBuilder* const alternative_phase =
      solver.MakePhase(all_alternative_variables, Solver::CHOOSE_MIN_SIZE,
                       Solver::ASSIGN_MIN_VALUE);

  // This decision builder will rank all tasks on all machines.
  DecisionBuilder* const sequence_phase =
      solver.MakePhase(all_sequences, Solver::SEQUENCE_DEFAULT);

  // After the ranking of tasks, the schedule is still loose and any
  // task can be postponed at will. But, because the problem is now a PERT
  // (http://en.wikipedia.org/wiki/Program_Evaluation_and_Review_Technique),
  // we can schedule each task at its earliest start time. This is
  // conveniently done by fixing the objective variable to its
  // minimum value.
  DecisionBuilder* const obj_phase = solver.MakePhase(
      objective_var, Solver::CHOOSE_FIRST_UNBOUND, Solver::ASSIGN_MIN_VALUE);

  // The main decision builder (ranks all tasks, then fixes the
  // objective_variable).
  DecisionBuilder* const main_phase =
      solver.Compose(alternative_phase, sequence_phase, obj_phase);

  // Search log.
  const int kLogFrequency = 1000000;
  SearchMonitor* const search_log =
      solver.MakeSearchLog(kLogFrequency, objective_monitor);

  SearchLimit* limit = nullptr;
  if (FLAGS_time_limit_in_ms > 0) {
    limit = solver.MakeTimeLimit(FLAGS_time_limit_in_ms);
  }

  SolutionCollector* const collector = solver.MakeLastSolutionCollector();
  collector->AddObjective(objective_var);
  collector->Add(all_alternative_variables);
  collector->Add(all_sequences);

  // Search.
  if (solver.Solve(main_phase, search_log, objective_monitor, limit,
                   collector)) {
    for (int m = 0; m < machine_count; ++m) {
      SequenceVar* const seq = all_sequences[m];
      LOG(INFO) << seq->name() << ": "
                << absl::StrJoin(collector->ForwardSequence(0, seq), ", ");
    }
  }
}
}  // namespace operations_research

static const char kUsage[] =
    "Usage: see flags.\nThis program runs a simple flexible job shop"
    " optimization output besides the debug LOGs of the solver.";

int main(int argc, char** argv) {
  gflags::SetUsageMessage(kUsage);
  gflags::ParseCommandLineFlags(&argc, &argv, true);
  if (FLAGS_data_file.empty()) {
    LOG(FATAL) << "Please supply a data file with --data_file=";
  }
  operations_research::FlexibleJobShopData data;
  data.Load(FLAGS_data_file);
  operations_research::FlexibleJobshop(data);
  return EXIT_SUCCESS;
}